English
Related papers

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

200 papers

Non-degenerate bilinear forms over fields of characteristic 2, in particular, non-symmetric ones, are classified with respect to various equivalences, and the Lie algebras preserving them are described. Although it is known that there are…

Commutative Algebra · Mathematics 2007-05-23 Alexei Lebedev

In this paper we give a positive answer to the open existence problem for complex-valued harmonic morphisms from the non-compact irreducible Riemannian symmetric spaces $SL_n(R)/SO(n)$, $SU^*(2n)/Sp(n)$ and their compact duals $SU(n)/SO(n)$…

Differential Geometry · Mathematics 2009-11-11 Sigmundur Gudmundsson , Martin Svensson

Several open problems concerning Minkowski endomorphisms and Minkowski valuations are solved. More precisely, it is proved that all Minkowski endomorphisms are uniformly continuous but that there exist Minkowski endomorphisms that are not…

Metric Geometry · Mathematics 2017-02-23 Felix Dorrek

We consider the problem of sparse nonnegative matrix factorization (NMF) using archetypal regularization. The goal is to represent a collection of data points as nonnegative linear combinations of a few nonnegative sparse factors with…

Machine Learning · Statistics 2024-02-13 Kayhan Behdin , Rahul Mazumder

We checked each binary relation on a 5-element set for a given set of properties, including usual ones like asymmetry and less known ones like Euclideanness. Using a poor man's Quine-McCluskey algorithm, we computed prime implicants of…

Logic · Mathematics 2018-11-21 Jochen Burghardt

We characterize the words that can be mapped to arbitrarily high powers by injective morphisms. For all other words, we prove a linear upper bound for the highest power that they can be mapped to, and this bound is optimal up to a constant…

Formal Languages and Automata Theory · Computer Science 2025-03-04 Aleksi Saarela

We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, when applied recursively on a word, result in what we term as…

Combinatorics · Mathematics 2018-07-18 Ghajendran Poovanandran , Adrian Atanasiu , Wen Chean Teh

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at…

Combinatorics · Mathematics 2025-10-01 Pascal Ochem , Matthieu Rosenfeld

We study two classes of morphisms in infinite type: tamely presented morphisms and morphisms with coherent pullback. These are generalizations of finitely presented morphisms and morphisms of finite Tor-dimension, respectively. The class of…

Algebraic Geometry · Mathematics 2024-01-11 Sabin Cautis , Harold Williams

This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…

Analysis of PDEs · Mathematics 2026-05-04 Anouar Bahrouni

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…

Combinatorics · Mathematics 2013-02-05 Lubomíra Balková , Edita Pelantová , Štěpán Starosta

A word w is rich if it has |w|+1 many distinct palindromic factors, including the empty word. A word is square-free if it does not have a factor uu, where u is a non-empty word. Pelantov\'a and Starosta (Discrete Math. 313 (2013)) proved…

Combinatorics · Mathematics 2016-03-04 Jetro Vesti

A \emph{tangram} is a word in which every letter occurs an even number of times. Such word can be cut into parts that can be arranged into two identical words. The minimum number of cuts needed is called the \emph{cut number} of a tangram.…

Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement…

Formal Languages and Automata Theory · Computer Science 2013-10-18 M. Rao , M. Rigo , P. Salimov

While conformal transformations of the plane preserve Laplace's equation, Lorentz-conformal mappings preserve the wave equation. We discover how simple geometric objects, such as quadrilaterals and pairs of crossing curves, are transformed…

Differential Geometry · Mathematics 2013-07-04 Barbara A. Shipman , Patrick D. Shipman , Stephen P. Shipman

A graph G(V, E) is word-representable if there exists a word w over V such that distinct letters x and y alternate in w iff $xy \in E$. We introduce p-complete squares and p-complete square-free word-representable graphs. A word is…

Discrete Mathematics · Computer Science 2025-12-25 Biswajit Das , Ramesh Hariharasubramanian

We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…

Combinatorics · Mathematics 2013-02-19 Sergey Avgustinovich , Svetlana Puzynina

We settle an open problem of several years standing by showing that the least-squares mean for positive definite matrices is monotone for the usual (Loewner) order. Indeed we show this is a special case of its appropriate generalization to…

Metric Geometry · Mathematics 2010-07-28 Jimmie Lawson , Yongdo Lim

We introduce the complete lifts of maps between (real and complex) Euclidean spaces and study their properties concerning holomorphicity, harmonicity and horizontal weakly conformality. As applications, we are able to use this concept to…

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

A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$. A…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Tim Smith