Related papers: Stable Invariants of Words from Random Matrices
For an infinity of number rings we express stable motivic invariants in terms of topological data determined by the complex numbers, the real numbers, and finite fields. We use this to extend Morel's identification of the endomorphism ring…
We study infinite words coding an orbit under an exchange of three intervals which have full complexity $\C(n)=2n+1$ for all $n\in\N$ (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the…
We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
The width $\wid(G,W)$ of the verbal subgroup $v(G,W)$ of a group $G$ defined by a collection of group words $W$ is the smallest number $m$ in $\mathbb N \cup {+\infty}$ such that every element of $v(G,W)$ is can be represented as the…
Let $\Gamma$ be a finite index subgroup of the mapping class group $MCG(\Sigma)$ of a closed orientable surface $\Sigma$, possibly with punctures. We give a precise condition (in terms of the Nielsen-Thurston decomposition) when an element…
We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…
We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…
The distances between words calculated in word units are studied and compared with the distributions of the Random Matrix Theory (RMT). It is found that the distribution of distance between the same words can be well described by the…
A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…
Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…
This is a survey article on the stable cohomotopy refinement of Seiberg-Witten invariants containing also new results, for example: - Stable cohomotopy groups describe path components of certain mapping spaces. - Relation of stable…
Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…
Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can…
W-transforms are introduced as uniformity-preserving univariate transformations on the unit interval induced by distribution functions and piecewise strictly monotone functions, and their properties are investigated. When applied…
Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…
Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…
It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationships between any two entities (nodes). However, graphs neither…
Discrete stability extends the classical notion of stability to random elements in discrete spaces by defining a scaling operation in a randomised way: an integer is transformed into the corresponding binomial distribution. Similarly…
Many mathematical models of statistical physics in two dimensions are either known or conjectured to exhibit conformal invariance. Over the years, physicists proposed predictions of various exponents describing the behavior of these models.…