English
Related papers

Related papers: Discrete correlation of order 2 of generalized Rud…

200 papers

We investigate two Stieltjes continued fractions given by the paperfolding sequence and the Rudin-Shapiro sequence. By explicitly describing certain subsequences of the convergents $P_n(x)/Q_n(x)$ modulo $4$, we give the formal power series…

Number Theory · Mathematics 2020-04-02 Wen Wu

The normal ordering coefficients of strings consisting of $V,U$ which satisfy $UV=qVU+hV^s$ ($s\in\mathbb N$) are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized…

Combinatorics · Mathematics 2014-08-21 Roberto B. Corcino , Ken Joffaniel M. Gonzales , Richell O. Celeste

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Number Theory · Mathematics 2019-03-11 Marc Munsch , Igor E. Shparlinski , Kam Hung Yau

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…

Information Theory · Computer Science 2013-10-11 Wijik Lee , Ji-Youp Kim , Jong-Seon No

We investigate symbolic sequences and in particular information carriers as e.g. books and DNA--strings. First the higher order Shannon entropies are calculated, a characteristic root law is detected. Then the algorithmic entropy is…

adap-org · Physics 2008-02-03 Werner Ebeling , Alexander Neiman , Thorsten Pöschel

This paper shows that, with high probability, randomly punctured Reed-Solomon codes over fields of polynomial size achieve the list decoding capacity. More specifically, we prove that for any $\epsilon>0$ and $R\in (0,1)$, with high…

Information Theory · Computer Science 2025-09-03 Zeyu Guo , Zihan Zhang

An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero…

Information Theory · Computer Science 2025-08-20 Simon Blackburn , Yeow Meng Chee , Tuvi Etzion , Huimin Lao

We consider generalized Stirling numbers of the second kind $% S_{a,b,r}^{\alpha_{s},\beta_{s},r_{s},p_{s}}\left( p,k\right) $, $% k=0,1,\ldots .rp+\sum_{s=2}^{L}r_{s}p_{s}$, where $a,b,\alpha_{s},\beta_{s} $ are complex numbers, and…

Combinatorics · Mathematics 2018-03-19 Claudio Pita-Ruiz

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

Combinatorics · Mathematics 2014-01-23 Seth Pettie

We formalize a generalized form of the Pareto principle - ``fraction $p$ of inputs yields fraction $1-p$ of outputs'' - as a property of non-negative gain densities $\ell \in L^1([0,1])$, working with the decreasing rearrangement to obtain…

Physics and Society · Physics 2026-05-14 Antti Hippeläinen

We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks…

Statistical Mechanics · Physics 2009-11-10 Gilberto Corso

We generalise recent results about quasi-Cartan, Cartan and diagonal subalgebras by introducing graded versions. We show that there is a correspondence between graded algebraic quasi-Cartan/ Cartan/ diagonal pairs and certain graded twisted…

Rings and Algebras · Mathematics 2025-06-02 Lisa Orloff Clark , Lynnel D. Naingue , Jocelyn P. Vilela

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

Using the notion of compatibility between Poisson brackets and cluster structures in the coordinate rings of simple Lie groups, Gekhtman Shapiro and Vainshtein conjectured a correspondence between the two. Poisson Lie groups are classified…

Quantum Algebra · Mathematics 2015-11-30 Idan Eisner

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

Probability · Mathematics 2024-05-31 Sergey G. Bobkov , Maria A. Danshina , Vladimir V. Ulyanov

We investigate the large deviations of the shape of the random RSK Young diagrams associated with a random word of size $n$ whose letters are independently drawn from an alphabet of size $m=m(n)$. When the letters are drawn uniformly and…

Probability · Mathematics 2016-08-14 Christian Houdré , Jinyong Ma

Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…

Information Theory · Computer Science 2021-07-27 Zhixiong Chen , Ana I. Gómez , Domingo Gómez-Pérez , Andrew Tirkel

Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term arithmetic progressions. It is conjectured that there is a dichotomy between such sequences: those that have a periodic structure as the sequence satisfies…

Combinatorics · Mathematics 2020-04-07 Mehtaab Sawhney

We consider a numeration system in the ring of integers ${\mathcal O}_K$ of a number field, which we assume to be principal. We prove that the property of being a prime in ${\mathcal O}_K$ is decorrelated from two fundamental examples of…

Number Theory · Mathematics 2022-01-28 Sary Drappeau , Gautier Hanna

Generalized Davenport-Schinzel sequences are sequences that avoid a forbidden subsequence and have a sparsity requirement on their letters. Upper bounds on the lengths of generalized Davenport-Schinzel sequences have been applied to a…

Discrete Mathematics · Computer Science 2019-12-12 Jesse Geneson