Related papers: Random Fibonacci Words via Clone Schur Functions
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
To determine whether some often-used lexical association measures assign high scores to n-grams that chance could have produced as frequently as observed, we used an extension of Fisher's exact test to sequences longer than two words to…
The Cauchy identities play an important role in the theory of symmetric functions. It is known that Cauchy sums for the $q$-Whittaker and the skew Schur polynomials produce the same factorized expressions modulo a $q$-Pochhammer symbol. We…
We provide a detailed analysis of the classical and quantized theory of a multiplet of inhomogeneous Klein-Gordon fields, which couple to the spacetime metric and also to an external source term; thus the solutions form an affine space.…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We introduce two new bases for polynomials that lift monomial and fundamental quasisymmetric functions to the full polynomial ring. By defining a new condition on pipe dreams, called quasi-Yamanouchi, we give a positive combinatorial rule…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
A novel positive dependence property is introduced, called positive measure inducing (PMI for short), being fulfilled by numerous copula classes, including Gaussian, Fr\'echet, Farlie-Gumbel-Morgenstern and Frank copulas; it is conjectured…
Finite-state independence is a robust notion of algorithmic independence for infinite words. It was introduced for general infinite words by Becher, Carton, and Heiber via deterministic asynchronous two-tape finite automata. \'Alvarez,…
Motivated by statistical applications, this paper introduces Cauchy identities for characters of the compact classical groups. These identities generalize the well-known Cauchy identity for characters of the unitary group, which are Schur…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…
A fractional fuzzy Potts measure is a probability distribution on spin configurations of a finite graph $G$ obtained in two steps: first a subgraph of $G$ is chosen according to a random cluster measure $\phi_{p,q}$, and then a spin…
We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…
Fix two words over the binary alphabet $\{0,1\}$, and generate iid Bernoulli$(p)$ bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was popularized by Conway, who found (in unpublished work) a…
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…
The Springer modules have a combinatorial property called ``coincidence of dimensions,'' i.e., the Springer modules are naturally decomposed into submodules with common dimensions. Morita and Nakajima proved the property by giving modules…
We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…
We perform a systematic classification of (2+1)d Gross--Neveu--Yukawa-like models built out of one or more 4-component Dirac fermions and $M$ scalar fields, which preserve an O($M$) symmetry rotating the scalars. We then identify the…