English
Related papers

Related papers: Another Solution to the Thue Problem of Non-Repeat…

200 papers

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Number Theory · Mathematics 2014-07-21 H. A. Helfgott

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…

Formal Languages and Automata Theory · Computer Science 2015-03-24 Paul Bell , Daniel Reidenbach , Jeffrey Shallit

We study valued fields equipped with an automorphism. We prove that all of them have an extension admitting an equivariant cross-section of the valuation. In residual characteristic zero, and in the presence of such a cross-section, we show…

Logic · Mathematics 2025-12-18 Jan Dobrowolski , Francesco Gallinaro , Rosario Mennuni

The question of whether all words in two real positive definite letters have only positive eigenvalues is addressed and settled (negatively). This question was raised some time ago in connection with a long-standing problem in theoretical…

Operator Algebras · Mathematics 2007-05-23 Christopher J Hillar , Charles R Johnson

We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al.

Combinatorics · Mathematics 2009-11-30 James Currie , Narad Rampersad

The issue of symmetry and symmetry breaking is fundamental in all areas of science. Symmetry is often assimilated to order and beauty while symmetry breaking is the source of many interesting phenomena such as phase transitions,…

Analysis of PDEs · Mathematics 2017-12-01 Jean Dolbeault , Maria J. Esteban , Michael Loss , Maria Esteban

In this note, we give an elementary proof of the following classical fact. Any positive definite ternary quadratic form over the rational numbers fails to represent infinitely many positive integers. For any ternary quadratic form (positive…

History and Overview · Mathematics 2021-09-22 Amir Jafari , Farhood Rostamkhani

P. Baird and the second author studied harmonic morphisms from a three-dimensional simply-connected space form to a surface and obtained a complete local and global classification of them. In this paper, we obtain a description of all…

dg-ga · Mathematics 2008-02-03 M. T. Mustafa , J. C. Wood

Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…

Logic in Computer Science · Computer Science 2025-03-04 David M. Cerna

We introduce O-systems (Definition \ref{DO}) of orthogonal transformations of ${\Bbb R}^{m}$, and establish $1-1$ correspondences both between equivalence classes of Clifford systems and that of O-systems, and between O-systems and…

dg-ga · Mathematics 2008-02-03 Ye-lin Ou

We prove that every weak solution to a certain class of infinitely degenerate quasilinear equations is continuous. An essential feature of the operators we consider is that their Fefferman-Phong associated metric may be non doubling with…

Analysis of PDEs · Mathematics 2014-02-03 Lyudmila Korobenko , Cristian Rios

In this paper we give a unified framework for the construction of complex valued harmonic morphisms from the real, complex and quaternionic Grassmannians and their non-compact duals. This gives a positive answer to the corresponding open…

Differential Geometry · Mathematics 2007-05-23 Sigmundur Gudmundsson , Martin Svensson

We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…

Formal Languages and Automata Theory · Computer Science 2012-07-11 Joerg Endrullis , Dimitri Hendriks

A 1-11-representation of a graph $G(V,E)$ is a word over the alphabet $V$ such that two distinct vertices $x$ and $y$ are adjacent if and only if the restricted word $w{x,y}$ (obtained from $w$ by deleting all letters except $x$ and $y$)…

Combinatorics · Mathematics 2026-01-29 Biswajit Das , Ramesh Hariharasubramanian

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…

Combinatorics · Mathematics 2026-05-28 Jeffrey Shallit

A (positive definite and non-classic integral) quadratic form is called strongly $s$-regular if it satisfies a strong regularity property on the number of representations of squares of integers. In this article, we prove that for any…

Number Theory · Mathematics 2019-09-05 Kyoungmin Kim , Byeong-Kweon Oh

In this article, we present the symmetry of weak solutions to a mixed local-nonlocal singular problem. We also establish results related to the existence, nonexistence, and regularity of weak solutions to a mixed local-nonlocal singular…

Analysis of PDEs · Mathematics 2025-06-09 Gurdev Chand Anthal , Prashanta Garain

We study the r-th elementary symmetric polynomial in $n$ variables with 2<r<n. There are two kinds of linear transformations on the parameter space that leave this polynomial invariant: Namely, any permutation of the variables and…

Commutative Algebra · Mathematics 2016-07-29 Jesko Hüttenhain

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…

Number Theory · Mathematics 2022-07-12 Daniel E. Martin

Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…

Computation and Language · Computer Science 2017-04-28 Clara Vania , Adam Lopez