Related papers: Properties of Pseudo-Primitive Words and their App…
We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation \sigma\ as a pattern, the shape of w contains the…
Let $F$ be a free group of rank $r$ and fix some $w\in F$. For any compact group $G$ we can define a measure $\mu_{w,G}$ on $G$ by (Haar-)uniformly sampling $g_1,...,g_r\in G$ and evaluating $w(g_1,...,g_r)$. In [arXiv:1802.04862], Magee…
Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…
We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the…
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We…
A super-modular category is a unitary pre-modular category with M\"uger center equivalent to the symmetric unitary category of super-vector spaces. Super-modular categories are important alternatives to modular categories as any unitary…
The paper counts the number of reduced quasigroup words of a particular length in a certain number of generators. Taking account of the relationship with the Catalan numbers, counting words in a free magma, we introduce the term…
The present paper records more details of the relationship between primitive elements and palindromes in F_2, the free group of rank two. We characterise the conjugacy classes of primitive elements which contain palindromes as those which…
Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and…
A random vector ${\bf X}$ is weakly stable iff for all $a,b \in \mathbb{R}$ there exists a random variable $\Theta$ such that $a{\bf X} + b {\bf X}' \stackrel{d}{=} {\bf X} \Theta$, where $X'$ is an independent copy of $X$ and $\Theta$ is…
It is easy to show that a pseudovariety which is reducible with respect to an implicit signature $\sigma$ for the equation $x=y$ can also be defined by $\sigma$-identities. We present several negative examples for the converse using…
We find surface subgroups in certain one-relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Given a nonempty finite word $v$, let $PL(v)$ be the palindromic length of $v$; it means the minimal number of palindromes whose concatenation is equal to $v$. Let $v^R$ denote the reversal of $v$. Given a finite or infinite word $y$, let…
In this paper, we study the static cell probe complexity of non-adaptive data structures that maintain a subset of $n$ points from a universe consisting of $m=n^{1+\Omega(1)}$ points. A data structure is defined to be non-adaptive when the…
We study the fully degenerate second-order evolution equation $u_t=a^{ij}(t)u_{x^ix^j} +b^i(t) u_{x^i} + c(t)u+f, \quad t>0, x\in \mathbb{R}^d$ given with the zero initial data. Here $a^{ij}(t)$, $b^i(t)$, $c(t)$ are merely locally…
Syntactic structures used to play a vital role in natural language processing (NLP), but since the deep learning revolution, NLP has been gradually dominated by neural models that do not consider syntactic structures in their design. One…
We introduce the theory $\mathrm{PF}^{+,\times}$ of pseudofinite fields with generic additive and multiplicative character added as continuous logic predicates. Using the Weil bounds on character sums over finite fields as well as the…