相关论文: Shifts of Finite Type Obtained by Forbidding a Sin…

Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…

We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string $w$, a bidirectional macro scheme of size $O(r_B)$ can be induced from the BBWT of $w$, where $r_B$ is the number of maximal character…

Context-free session types describe structured patterns of communication on heterogeneously-typed channels, allowing the specification of protocols unconstrained by tail recursion. The enhanced expressive power provided by non-regular…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

A famous result due to Lov\'{a}sz states that two finite relational structures $M$ and $N$ are isomorphic if, and only if, for all finite relational structures $T$, the number of homomorphisms from $T$ to $M$ is equal to the number of…

A word-representable graph is a simple graph $G$ which can be represented by a word $w$ over the vertices of $G$ such that any two vertices are adjacent in $G$ if and only if they alternate in $w$. It is known that the class of…

Let (g,k) be a reductive symmetric superpair of even type, i.e. so that there exists an even Cartan subspace a in p. The restriction map S(p^*)^k->S(a^*)^W where W=W(g_0:a) is the Weyl group, is injective. We determine its image explicitly.…

The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…

We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…

In this paper we study graphs defined by pattern-avoiding words. Word-representable graphs have been studied extensively following their introduction in 2000 and are the subject of a book published by Kitaev in 2015. Recently there has been…

In 2013 Benkart, Lopes and Ondrus introduced and studied in a series of papers the infinite-dimensional unital associative algebra $\A_h$ generated by elements $x,y,$ which satisfy the relation $yx-xy=h$ for some $0\neq h\in \FF[x]$. We…

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

We study families of possibly overlapping self-affine sets. Our main example is a family that can be considered the self-affine version of Bernoulli convolutions and was studied, in the non-overlapping case, by F.Przytycki and M.Urbanski.…

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

We present four generalized small cancellation conditions for finite presentations and solve the word- and conjugacy problem in each case. Our conditions $W$ and $W^*$ contain the non-metric small cancellation cases C(6), C(4)T(4), C(3)T(6)…

The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shuffle Product: New Research Directions} by Restivo (2015) we…

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…