Related papers: Left-to-right maxima in words and multiset permuta…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…

Consider Plurality with random tie-breaking. This paper uses standard axiomatic extensions of preferences over elements to preferences over sets (Kelly, Gardenfors, Responsiveness) to characterize all better-replies of a voter under…

Can autoregressive large language models (LLMs) learn consistent probability distributions when trained on sequences in different token orders? We prove formally that for any well-defined probability distribution, sequence perplexity is…

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

A topological argument is presented concering the structure of semantic space, based on the negative correlation between polysemy and word length. The resulting graph structure is applied to the modeling of free-recall experiments,…

In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism $\Theta$. It generalizes the notion of a palindrome into a $\Theta$-palindrome -- a word invariant under $\Theta$. For languages…

We consider (graph-)group-valued random element $\xi$, discuss the properties of a mean-set $\ME(\xi)$, and prove the generalization of the strong law of large numbers for graphs and groups. Furthermore, we prove an analogue of the…

Continuous word representations learned separately on distinct languages can be aligned so that their words become comparable in a common space. Existing works typically solve a least-square regression problem to learn a rotation aligning a…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

We introduce alphabet-permutation (AP) codes, a new family of error-correcting codes defined by iteratively applying random coordinate-wise permutations to a fixed initial word. A special case recovers random additive codes and random…

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…

A complete proof is given of relative interpretability of Adjunctive Set Theory with Extensionality in an elementary concatenation theory.

We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.

The problem addressed concerns the determination of the average number of successive attempts of guessing a word of a certain length consisting of letters with given probabilities of occurrence. Both first- and second-order approximations…

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…

Zipf's law describes the empirical size distribution of the components of many systems in natural and social sciences and humanities. We show, by solving a statistical model, that Zipf's law co-occurs with the maximization of the diversity…

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…