中文
相关论文

相关论文: Quasiperiodic Sturmian words and morphisms

200 篇论文

Consider the minimal $\beta$-shift containing the shift space generated by given Sturmian word. In this paper we characterize such $\beta$ and investigate its combinatorial, dynamical and topological properties and prove that such $\beta$…

组合数学 · 数学 2007-05-23 Dong Pyo Chi , DoYong Kwon

We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…

群论 · 数学 2008-02-03 Ilya Kapovich

We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order…

计算机科学中的逻辑 · 计算机科学 2024-08-14 Philipp Hieronymi , Dun Ma , Reed Oei , Luke Schaeffer , Christian Schulz , Jeffrey Shallit

A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t). Properties of pseudo-primitive words are investigated in…

计算复杂性 · 计算机科学 2010-02-23 Lila Kari , Benoît Masson , Shinnosuke Seki

Most words have several senses and connotations which evolve in time due to semantic shift, so that closely related words may gain different or even opposite meanings over the years. This evolution is very relevant to the study of language…

计算与语言 · 计算机科学 2018-05-31 Jean-François Delpech

This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).

离散数学 · 计算机科学 2008-05-12 Brendan Lucier

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

离散数学 · 计算机科学 2014-07-15 Gabriele Fici , Luca Q. Zamboni

Prefix normal words are binary words that have no factor with more $1$s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt\'ak, DLT 2011]. In this paper, we study infinite prefix normal words…

组合数学 · 数学 2021-05-31 Ferdinando Cicalese , Zsuzsanna Lipták , Massimiliano Rossi

We give a condition for an almost constant-type manifold to be a constant-type manifold, and holomorphic and $R$-invariant submanifolds of almost Hermitian manifolds are studied. Generalizations of some results in [5] are given.

微分几何 · 数学 2013-11-12 Hakan Mete Taştan

A word $w$ over an alphabet $\Sigma$ is a Lyndon word if there exists an order defined on $\Sigma$ for which $w$ is lexicographically smaller than all of its conjugates (other than itself). We introduce and study \emph{universal Lyndon…

离散数学 · 计算机科学 2014-07-15 Arturo Carpi , Gabriele Fici , Stepan Holub , Jakub Oprsal , Marinella Sciortino

Quasi-period collapse occurs when the Ehrhart quasi-polynomial of a rational polytope has a quasi-period less than the denominator of that polytope. This phenomenon is poorly understood, and all known cases in which it occurs have been…

组合数学 · 数学 2007-09-27 Christian Haase , Tyrrell B. McAllister

A quasi-schemoid is a small category with a particular partition of the set of morphisms. We define a homotopy relation on the category of quasi-schemoids and study its fundamental properties. As a homotopy invariant, the homotopy set of…

范畴论 · 数学 2014-10-27 Katsuhiko Kuribayashi

We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…

泛函分析 · 数学 2011-03-09 Pekka Koskela , Vesna Manojlović

We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…

组合数学 · 数学 2025-10-06 Wenjie Fang

Quantization problems suggest that the category of symplectic manifolds and symplectomorphisms be augmented by the inclusion of canonical relations as morphisms. These relations compose well when a transversality condition is satisfied, but…

辛几何 · 数学 2009-11-24 Alan Weinstein

This paper continues our study of quasicrystals initiated in Part I. We propose a general mechanism for constructing quasicrystals, existing globally in time, in spatially-extended systems (partial differential equations with Euclidean…

动力系统 · 数学 2025-01-31 Ian Melbourne , Jens Rademacher , Bob Rink , Sergey Zelik

Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…

组合数学 · 数学 2021-08-04 Svetlana Puzynina , Markus A. Whiteland

The authors investigate the structure of quasi-o-minimal groups. Among other results, they show that quasi-o-minimal groups are abelian, that quasi-o-minimal densely ordered archimedian groups are divisible, and that every divisible…

环与代数 · 数学 2008-02-03 Oleg Belegradek , Ya'acov Peterzil , Frank Wagner

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.…

组合数学 · 数学 2013-02-19 Sergey Avgustinovich , Svetlana Puzynina

In a recent series of papers we have analyzed a certain deformation of the canonical commutation relations producing an interesting functional structure which has been proved to have some connections with physics, and in particular with…

数学物理 · 物理学 2015-06-05 Fabio Bagarello