26 Hits in 4.4 sec

Page 5969 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
Heubach, Silvia (1-CASLA; Los Angeles, CA) The frequency of summands of a particular size in palindromic compositions.  ...  This paper shows vari- ous ways of generating all palindromic compositions, counts the number of times each integer appears as a summand among all the palindromic compositions of n, and describes several  ... 

Enumeration of Special Sets of Polynomials over Finite Fields

Astrid Reifegerste
1999 Finite Fields and Their Applications  
Our focus is on the enumeration of these special sets of polynomials, in particular, we give the number of squarefree palindromes.  ...  These investigations make it possible to estimate the efficiency of the prefactorization of polynomials over finite fields based on such gcd calculations. Academic Press  ...  In particular, the number of nonsquarefree polynomials corresponding to the degree composition (d , 2, 1) can be specified for all d .  ... 
doi:10.1006/ffta.1998.0231 fatcat:3oslll3yorcg7axcatqj5sqgay

Generating large Ising models with Markov structure via simple linear relations [article]

Nanny Wermuth, Giovanni M. Marchetti
2017 arXiv   pre-print
This implies that the strength of dependences can be assessed locally. We use the results to find a well-fitting general Ising model with hollow-tree structure for a set of longitudinal data.  ...  These structures are especially attractive for palindromic Ising models, which mimic a symmetry of joint Gaussian distributions.  ...  Weck for letting us reanalyze his data and David Cox for most helpful discussions and comments, especially for the proof of equivalence of the model formulations in terms of the log-linear and the hypetan  ... 
arXiv:1704.01649v1 fatcat:xl2eveufwjae5kkpkgv2itd7u4

Modeling RNA polymerase competition: the effect of σ-subunit knockout and heat shock on gene transcription level

Vassily A Lyubetsky, Oleg A Zverkov, Lev I Rubanov, Alexandr V Seliverstov
2011 Biology Direct  
of RNA polymerases and the transcription process that are difficult to measure directly, e.g., the intensity (frequency) of holoenzyme binding to the promoter in correlation to its nucleotide composition  ...  The model allows to hypothesize a mechanism of cell response to knockout and heat shock, as well as a mechanism of gene expression regulation in presence of RNA polymerase competition.  ...  Acknowledgements We thank Mikhail Gelfand for the possibility to give a talk on this paper and valuable discussion. We thank Leonid Rusin for substantial contribution in Lyubetsky et al.  ... 
doi:10.1186/1745-6150-6-3 pmid:21255416 pmcid:PMC3038987 fatcat:yybsrnoogjapbhvw743ndmrldm

The "Wow! signal" of the terrestrial genetic code

Vladimir I. shCherbak, Maxim A. Makukov
2013 Icarus (New York, N.Y. 1962)  
A statistically strong signal in the genetic code is then a testable consequence of such scenario.  ...  Though smaller in capacity, but stronger in noise immunity is the genetic code.  ...  Acknowledgments Partially the study was financed by the Ministry of Education and Science of the Republic of Kazakhstan. The research was appreciably promoted by Professor Bakytzhan T.  ... 
doi:10.1016/j.icarus.2013.02.017 fatcat:z3kzzaclijavvjd7gwwg4x4a4a

Modes, the Height-Width Duality, and Handschin's Tone Character

David Clampitt, Thomas Noll
2011 Music Theory Online  
An overview of the theory is presented in terms of a dichotomy between generic and specific levels of description. Section 2 presents a first group of basic theoretical results.  ...  The theory of well-formed modes is a modal refinement of the theory of well-formed scales.  ...  value ev (w ) = |w| among the n summands in s is exactly |w| .  ... 
doi:10.30535/mto.17.1.2 fatcat:kyc4zktrcjed5dhnudh5hm7i7q

Normal and Compound Poisson Approximations for Pattern Occurrences in NGS Reads

Zhiyuan Zhai, Gesine Reinert, Kai Song, Michael S. Waterman, Yihui Luan, Fengzhu Sun
2012 Journal of Computational Biology  
We show the accuracy of these approximations under a variety of conditions for different patterns with various characteristics.  ...  Word pattern counting (the study of the probabilistic distribution of the number of occurrences of word patterns in one or multiple long sequences) has played an important role in molecular sequence analysis  ...  of summands is large.  ... 
doi:10.1089/cmb.2012.0029 pmid:22697250 pmcid:PMC3375642 fatcat:usbenxjbrrexjll5yp7rgs4wj4

Wave delocalization and transfer efficiency enhancement in locally symmetric disordered chains [article]

C. V. Morfonios, M. Röntgen, F. K. Diakonos, P. Schmelcher
2018 arXiv   pre-print
The transfer may further be drastically amplified in the presence of spatial overlap between the symmetry domains, and in particular when global and local symmetry coexist.  ...  We find that a transition to more delocalized and fragmented eigenstates occurs for intermediate average symmetry domain sizes, depending on the degree of disorder.  ...  In particular, the possibility to amplify signal transfer by the coexistence of global and local symmetry in composite systems is thus demonstrated.  ... 
arXiv:1807.02793v2 fatcat:nabgqo5a4jdkvh424unlwsx6ua

Perturbative formulation of general continuous-time Markov model of sequence evolution via insertions/deletions, Part IV: Incorporation of substitutions and other mutations [article]

Kiyoshi Ezawa, Dan Graur, Giddy Landan
2015 bioRxiv   pre-print
In terms of frequencies, however, substitutions are usually more common than indels.  ...  In a separate paper (Ezawa, Graur and Landan 2015a), we established the theoretical basis of ourab initioperturbative formulation of a continuous-time Markov model of the evolution of anentiresequence  ...  The summand is the probability of ω v(D) [B i ] at time t v(D) conditioned on the initial state ω A [B i ] . Thus, in this case, the summation Eq.  ... 
doi:10.1101/023622 fatcat:omnq5uz7ubfwnacqrlszyisali

From indexed grammars to generating functions

Jared Adams, Eric Freden, Marni Mishna
2013 RAIRO - Theoretical Informatics and Applications  
We extend the Chomsky/Sch\"utzenberger method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages.  ...  We illustrate the technique with numerous examples.  ...  The third author offers thanks to Mike Zabrocki and the participants of the Algebraic Combinatorics seminar at the Fields Institute for Research in Mathematical Science (Toronto, Canada) for early discussions  ... 
doi:10.1051/ita/2013041 fatcat:syf5uxsxmrgcbhil2sdgeimjwq

What is an answer? - remarks, results and problems on PIO formulas in combinatorial enumeration, part I [article]

Martin Klazar
2018 arXiv   pre-print
It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and the output f(n), both written in binary notation.  ...  For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula.  ...  The OEIS database [154] was very helpful. I thank I. Pak for valuable comments and references.  ... 
arXiv:1808.08449v2 fatcat:p4leu3uhzbdmvbnteqf7qozn3u

Editorial Board

2016 Journal of Bacteriology  
A. Zenchenko and K. I. Zenchenko's help in conducting measurements and maintaining a computer archive of experimental results.  ...  A. Shlekhtarev for making devices used in the experiments with collimators. We are grateful to D. D. Rabounski for valuable discussions and comments on the text of our manuscripts.  ...  Therefore, linear parameters v, a, a 0 of the stationary rotation are described by the first summands in the right part of the formulas (13)- (15) . The rest summands containing ! 0 and !  ... 
doi:10.1128/jb.masthead.198-14 fatcat:vasm6gzuzrbdzcpyqudmv4u2ya

Page 996 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
The frequency of summands of a particular size in palindromic compositions. (English summary) Ars Combin. 69 (2003), 65-78.  ...  Rises, levels, drops and “+” signs in compositions: extensions of a paper by Alladi and Hoggatt. Fibonacci Quart. 41 (2003), no. 3, 229-239. (David M.  ... 

Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast Algorithms and Architectures [article]

Mohammad M. Mansour
2014 arXiv   pre-print
Serial pruning is a simple technique to alter the length of a permutation to support a wider range of lengths, but results in a serial processing bottleneck.  ...  Using this statistic, a recursive algorithm that computes the minimum inliers count of a pruned BR interleaver (PBRI) in logarithmic time complexity is presented.  ...  To interleave a block of size β, a mother interleaver whose size is the smallest power-of-2 that is ≥ β is selected and pruned. Hence, in the following, we assume that k/2 < β < k.  ... 
arXiv:1410.4954v1 fatcat:xltgcfrtszcidfp65jl5oxzjda

Can We Explain Students' Failure in Learning Multiplication? [chapter]

Maria del Carmen Chamorro
2020 Teaching Multiplication with Lesson Study  
Additionally, other kinds of calculation, like mental calculation and calculations with a calculator, have not yet reached the level of importance of their use in education that citizens require in a contemporary  ...  Recent investigations in neuroscience suggest that our way of teaching is not congruent with how the brain works and, as such, important changes should be made in teaching of numerical facts and algorithms  ...  We should also ask ourselves about the usefulness of algorithms in daily life and their frequency of use.  ... 
doi:10.1007/978-3-030-28561-6_11 fatcat:s4kfdyvtbzeynnd7q7ytmn5tq4
« Previous Showing results 1 — 15 out of 26 results