Related papers: On a property discovered by Xavier Grandsart
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…
Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
In his seminal Inventiones paper from 1972 Grauert proved the existence of a semiuniversal deformation of an arbitrary complex analytic isolated singularity. For the proof he invented an approximation theorem for solving a system of…
In this paper, based on the WZ theory, a very succinct new proof, of an identity by Chaundy and Bullard, was given.
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
It has been argued by Shepard that there is a robust psychological law that relates the distance between a pair of items in psychological space and the probability that they will be confused with each other. Specifically, the probability of…
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…
Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…
The statistics of the smallest eigenvalue of Wishart-Laguerre ensemble is important from several perspectives. The smallest eigenvalue density is typically expressible in terms of determinants or Pfaffians. These results are of utmost…
A word $u$ is a scattered factor of $w$ if $u$ can be obtained from $w$ by deleting some of its letters. That is, there exist the (potentially empty) words $u_1,u_2,..., u_n$, and $v_0,v_1,..,v_n$ such that $u = u_1u_2...u_n$ and $w =…
We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.
An overlap-free (or $\beta$-free) word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ at any position contains an overlap (or a factor of exponent at least $\beta$,…
Consider a space X with the singular locus, Z=Sing(X), of positive dimension. Suppose both Z and X are locally complete intersections. The transversal type of X along Z is generically constant but at some points of Z it degenerates. We…
It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…
Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example is the Hall-Thue word, fixed point of the morphism…
Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…