Related papers: Random Fibonacci Words via Clone Schur Functions
The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…
Quantum spin models have been studied extensively in one and higher dimensions. Furthermore, these systems have been doped with holes to study $t$--$J$ models of $SU(2)$ spin-1/2. Their anyonic counterparts can be built from non-Abelian…
We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…
We introduce a new dependence order, termed the conditional convex order, whose minimal and maximal elements characterize independence and perfect dependence. Moreover, it characterizes conditional independence, satisfies information…
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…
We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
We develop a quantitative theory of Lipschitz harmonic functions (LHF) on finitely generated groups, with emphasis on the Lipschitz Liouville property, affine rigidity, and quasi-isometric invariance for groups of polynomial growth. On…
We obtain exact formulas for moments and generating functions of the height function of the asymmetric simple exclusion process at one spatial point, starting from special initial data in which every positive even site is initially…
Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
We introduce a new type of test for complete spatial randomness that applies to mapped point patterns in a rectangle or a cube of any dimension. This is the first test of its kind to be based on characteristic functions and utilizes a…
Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict…
An $n$-length binary word is $q$-decreasing, $q\geq 1$, if every of its length maximal factor of the form $0^a1^b$ satisfies $a=0$ or $q\cdot a > b$.We show constructively that these words are in bijection with binary words having no…
The capability of string theories to reproduce at low energy the observed pattern of quark and lepton masses and mixing angles is examined, focusing the attention on orbifold constructions, where the magnitude of Yukawa couplings depends on…
A combinatorial structure, $\mathcal{F}$, with counting sequence $\{a_n\}_{n\ge 0}$ and ordinary generating function $G_\mathcal{F}=\sum_{n\ge0} a_n x^n$, is positive algebraic if $G_\mathcal{F}$ satisfies a polynomial equation…
In this paper we study Fresnel pseudoprocesses whose signed measure density is a solution to a higher-order extension of the equation of vibrations of rods. We also investigate space-fractional extensions of the pseudoprocesses related to…
In this paper, we study the concept of Fibonacci statistical convergence on intuitionisitic fuzzy normed space. We define the Fibonacci statistically Cauchy sequences with respect to an intuitionisitic fuzzy normed space and introduce the…