English
Related papers

Related papers: Common substring with shifts in b-ary expansions

200 papers

In this paper, we show that circular $(s,t)$-Furstenberg sets in $\mathbb R^2$ have Hausdorff dimension at least $$\max\{\frac{t}3+s,(2t+1)s-t\} \text{ for all $0<s,t\le 1$}.$$ This result extends the previous dimension estimates on…

Classical Analysis and ODEs · Mathematics 2023-02-28 Jiayin Liu

We study the classical expander codes, introduced by Sipser and Spielman \cite{SS96}. Given any constants $0< \alpha, \varepsilon < 1/2$, and an arbitrary bipartite graph with $N$ vertices on the left, $M < N$ vertices on the right, and…

Information Theory · Computer Science 2022-01-11 Xue Chen , Kuan Cheng , Xin Li , Minghui Ouyang

The properties of antiferromagnetic Heisenberg $S=\frac{1}{2}$ ladders with 2, 3, and 4 chains are expanded in the ratio of the intra- and interchain coupling constants. A simple mapping procedure is introduced to relate the 4 and 2-chain…

Condensed Matter · Physics 2009-10-22 M. Reigrotzki , H. Tsunetsugu , T. M. Rice

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

Dynamical Systems · Mathematics 2012-08-23 Nikos Frantzikinakis , Mate Wierdl

Overlap-free words are words over the binary alphabet $A=\{a, b\}$ that do not contain factors of the form $xvxvx$, where $x \in A$ and $v \in A^*$. We analyze the asymptotic growth of the number $u_n$ of overlap-free words of length $n$ as…

Discrete Mathematics · Computer Science 2007-09-13 Raphael M. Jungers , Vladimir Y. Protasov , Vincent D. Blondel

Let $C(X,I)$ be the lattice of all continuous functions on a compact Hausdorff space $X$ with values in the unit interval $I=[0,1]$. We show that for compact Hausdorff spaces $X$ and $Y$ and (not necessarily contain constants) sublattices…

Functional Analysis · Mathematics 2019-07-23 Vahid Ehsani , Fereshteh Sady

Let s be an integer greater than or equal to 2. A real number is simply normal to base s if in its base-s expansion every digit 0, 1, ..., s-1 occurs with the same frequency 1/s. Let X be the set of positive integers that are not perfect…

Number Theory · Mathematics 2013-11-05 Verónica Becher , Yann Bugeaud , Theodore A. Slaman

We consider an abstract sequence $\{A_n\}_{n=1}^\infty$ of closed symmetric operators on a separable Hilbert space $\mathcal{H}$. It is assumed that all $A_n$'s have equal deficiency indices $(k,k)$ and thus self-adjoint extensions…

Mathematical Physics · Physics 2023-12-15 August Bjerg

The length is(w) of the longest increasing subsequence of a permutation w in the symmetric group S_n has been the object of much investigation. We develop comparable results for the length as(w) of the longest alternating subsequence of w,…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

Let $1<\beta<2$. Given any $x\in[0, (\beta-1)^{-1}]$, a sequence $(a_n)\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion of $x$ if $x=\sum_{n=1}^{\infty}a_n\beta^{-n}.$ For any $k\geq 1$ and any $(b_1b_2\cdots b_k)\in\{0,1\}^{k}$, if…

Dynamical Systems · Mathematics 2017-03-08 Karma Dajani , Kan Jiang

We analyze short and long multiplets which appear in the OPE expansion of ``chiral'' primary operators in N=4 Super Yang--Mills theory. Among them, higher spin long and new short multiplets appear, having the interpretation, in the AdS/CFT…

High Energy Physics - Theory · Physics 2007-05-23 L. Andrianopoli , S. Ferrara

The longest common substring with $k$-mismatches problem is to find, given two strings $S_1$ and $S_2$, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance between $A_1$ and $A_2$ is $\le k$. We introduce a…

Data Structures and Algorithms · Computer Science 2015-04-08 Tomas Flouri , Emanuele Giaquinta , Kassian Kobert , Esko Ukkonen

We study the duplication with transposition distance between strings of length $n$ over a $q$-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form $x = (abcd) \to y = (abcbd)$, where…

Information Theory · Computer Science 2020-01-20 Nikita Polyanskii , Ilya Vorobyev

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

Probability · Mathematics 2007-05-23 Christian houdré , Trevis J. Litherland

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

Combinatorics · Mathematics 2014-10-23 Boris Bukh , Jie Ma

In this paper, we study $F_{n}(x,k)$, the number of binary strings of length $n$ containing $x$ zeros and a longest subword of $k$ zeros. A recurrence relation for $F_{n}(x,k)$ is derived. We expressed few known numbers like Fibonacci,…

Combinatorics · Mathematics 2019-05-08 Monimala Nej , A. Satyanarayana Reddy

We show that, for any fixed $\varepsilon > 0$ and almost all primes $p$, the $g$-ary expansion of any fraction $m/p$ with $\gcd(m,p) = 1$ contains almost all $g$-ary strings of length $k < (5/24 - \varepsilon) \log_g p$. This complements a…

Number Theory · Mathematics 2012-05-28 Igor E. Shparlinski , Wolfgang Steiner

Recently a new class of continued fraction algorithms, the $(N,\alpha$)-expansions, was introduced for each $N\in\mathbb{N}$, $N\geq 2$ and $\alpha \in (0,\sqrt{N}-1]$. Each of these continued fraction algorithms has only finitely many…

Dynamical Systems · Mathematics 2023-10-26 Cor Kraaikamp , Niels Langeveld

Motivated by the recent calculation of the SL(K+3,C) symmetry of n-point Lauricella string scattering amplitudes (SSA) of open bosonic string theory, we calculate ratios of the solvable infinite linear relations of arbitrary n-point hard…

High Energy Physics - Theory · Physics 2023-04-10 Sheng-Hong Lai , Jen-Chi Lee , Yi Yang

We initiate the study of the sets $H(c)$, $0<c<1$, of real $x$ for which the sequence $(kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $[0,c)$ at least as often as expected (i. e., with frequency $\geq c$). More formally, \[…

Number Theory · Mathematics 2009-11-12 Michael Boshernitzan , David Ralston
‹ Prev 1 3 4 5 6 7 10 Next ›