相关论文: A generalized palindromization map in free monoids

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph $\Lambda$ is a natural generalization of a higher rank graph. A pullback of $\Lambda$ is constructed by pulling it back over a given monoid morphism to $P$, while a…

We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…

We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…

In the early 60's J. B. Keller and D. Levy discovered a fundamental property: the instability tongues in Mathieu-type equations lose sharpness with the addition of higher-frequency harmonics in the Mathieu potentials. 20 years later V.…

A narrow connection between infinite binary words rich in classical palindromes and infinite binary words rich simultaneously in palindromes and pseudopalindromes (the so-called $H$-rich words) is demonstrated. The correspondence between…

Let $X$ be a normal geometrically connected variety over a finite field $\kappa$ of characteristic~$p$. Let $E$ be a number field. Using automorphic methods over global function fields, we derive properties of the geometric monodromy groups…

In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…

Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…

Let $X$ be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If $G$ is a finite graph covered by $X$, it is said to be $X$-Ramanujan if its second-largest eigenvalue $\lambda_2(G)$ is at most…

Recently the Fibonacci word $W$ on an infinite alphabet was introduced by [Zhang et al., Electronic J. Combinatorics 24-2 (2017) #P2.52] as a fixed point of the morphism $\phi: (2i) \mapsto (2i)(2i+ 1),\ (2i+ 1) \mapsto (2i+ 2)$ over all $i…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

M.-P. Sch\"utzenberger asked to determine the support of the free Lie algebra ${\mathcal L}_{{\mathbb Z}_{m}}(A)$ on a finite alphabet $A$ over the ring ${\mathbb Z}_{m}$ of integers $\bmod m$ and all the corresponding pairs of twin and…

Let $G$ be a locally compact group. For every $G$-flow $X$, one can consider the stabilizer map $x \mapsto G_x$, from $X$ to the space $\mathrm{Sub}(G)$ of closed subgroups of $G$. This map is not continuous in general. We prove that if one…

An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous…

We generalize a map by S. Mason regarding two combinatorial models for key polynomials, in a way that accounts for the major index. We also define similar variants of this map, that regards alternative models for the modified Macdonald…

Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a graph $G$, and the objective is to determine whether $G\models \psi$. Our main theorem states that…

In a 1976 landmark paper, Gordon James defined the regularisation maps on integer partition, yielding certain decomposition numbers for modular representations of $\mathfrak{S}_n$. We describe a generalisation of James's regularisation map…

Inspired by Pansiot's work on substitutions, we prove a similar theorem for automorphisms of a free group F of finite rank: if a right-infinite word X represents an attracting fixed point of an automorphism of F, the subword complexity of X…

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…