English
Related papers

Related papers: Star-free languages and local divisors

200 papers

Following problems posed by Gy\'arf\'as, we show that for every $r$-edge-colouring of $K_n$ there is a monochromatic triple star of order at least $n/(r-1)$, improving a previous result by Ruszink\'o. An edge colouring of a graph is called…

Combinatorics · Mathematics 2013-10-18 Shoham Letzter

For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids. The global sections of these…

Formal Languages and Automata Theory · Computer Science 2015-11-06 Liang-Ting Chen , Henning Urbat

We prove that episturmian words and Arnoux-Rauzy sequences can be characterized using a local balance property. We also give a new characterization of epistandard words and show that the set of finite words that are not factors of an…

Discrete Mathematics · Computer Science 2008-02-07 Gwénaël Richomme

A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with…

Group Theory · Mathematics 2021-09-07 S. V. Gusev

We show that the shuffle $L \unicode{x29E2} F$ of a piecewise-testable language $L$ and a finite language $F$ is piecewise-testable. The proof relies on a classic but little-used automata-theoretic characterization of piecewise-testable…

Formal Languages and Automata Theory · Computer Science 2019-02-05 Simon Halfon , Philippe Schnoebelen

In 2009, Shur published the following conjecture: Let $L$ be a power-free language and let $e(L)\subseteq L$ be the set of words of $L$ that can be extended to a bi-infinite word respecting the given power-freeness. If $u, v \in e(L)$ then…

Formal Languages and Automata Theory · Computer Science 2025-04-29 Josef Rukavicka

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Combinatorics · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

The paper completely characterizes the primality of acyclic DFAs, where a DFA $\mathcal{A}$ is prime if there do not exist DFAs $\mathcal{A}_1,\dots,\mathcal{A}_t$ with $\mathcal{L}(\mathcal{A}) = \bigcap_{i=1}^{t}…

Formal Languages and Automata Theory · Computer Science 2023-07-14 Daniel Alexander Spenner

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

Number Theory · Mathematics 2025-02-13 Benjamin Bedert

Techniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families L that are semilinear full trios, the…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Oscar H. Ibarra , Ian McQuillan

We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formulas appear. Earlier proofs of this fact relied on arguments…

Logic in Computer Science · Computer Science 2022-08-23 Andreas Krebs , Howard Straubing

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

Number Theory · Mathematics 2022-01-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

Group Theory · Mathematics 2009-11-10 Susan Hermiller , Steven Lindblad , John Meakin

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Logic · Mathematics 2019-03-28 Olga Kharlampovich , Laura Lopez

We study the ($\omega$-)regular separability problem for B\"uchi VASS languages: Given two B\"uchi VASS with languages $L_1$ and $L_2$, check whether there is a regular language that fully contains $L_1$ while remaining disjoint from $L_2$.…

Formal Languages and Automata Theory · Computer Science 2023-01-27 Pascal Baumann , Roland Meyer , Georg Zetzsche

Motivated by the theory of locally definable groups, we study the theory of $K$-vector spaces with a predicate for the union $X$ of an infinite family of independent subspaces. We show that if $K$ is infinite then the theory is complete and…

Logic · Mathematics 2025-03-14 Alessandro Berarducci , Marcello Mamino , Rosario Mennuni

A famous conjecture about group algebras of torsion-free groups states that there is no zero divisor in such group algebras. A recent approach to settle the conjecture is to show the non-existence of zero divisors with respect to the length…

Group Theory · Mathematics 2023-05-19 Alireza Abdollahi , Zahra Taheri

Let $(X,B)$ be a pair of a normal surface over a perfect field of characteristic $p>0$ and an effective $\mathbb{Q}$-divisor $B$ on $X$. We prove that Steenbrink-type vanishing holds for $(X,B)$ if it is log canonical and $p>5$, or it is…

Algebraic Geometry · Mathematics 2024-09-17 Tatsuro Kawakami

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

Combinatorics · Mathematics 2022-07-15 George E. Andrews , William J. Keith

Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order,…

Formal Languages and Automata Theory · Computer Science 2015-03-17 Manfred Kufleitner , Alexander Lauser
‹ Prev 1 8 9 10 Next ›