中文
相关论文

相关论文: Chains of affine standard Lyndon words

200 篇论文

We compute the limits of a class of periodic continued radicals and we establish a connection between them and the fixed points of the Chebycheff polynomials.

经典分析与常微分方程 · 数学 2012-08-21 Costas J. Efthimiou

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

环与代数 · 数学 2023-06-22 Adam Chapman , Solomon Vishkautsan

We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and…

组合数学 · 数学 2015-01-14 Brant Jones

Let $Y$ be a generic link of a subvariety $X$ of a nonsingular variety $A$. We give a description of the Grauert-Riemenschneider canonical sheaf of $Y$ in terms of the multiplier ideal sheaves associated to $X$ and use it to study the…

代数几何 · 数学 2013-06-20 Wenbo Niu

Nonlinear complexity is an important measure for assessing the randomness of sequences. In this paper we investigate how circular shifts affect the nonlinear complexities of finite-length binary sequences and then reveal a more explicit…

信息论 · 计算机科学 2024-04-26 Qin Yuan , Chunlei Li , Xiangyong Zeng , Tor Helleseth , Debiao He

The concept of "lost positions" is a recently introduced tool for counting the number of runs in words. We investigate the frequency of lost positions in prefixes of words. This leads to an algorithm that allows to show, using an extensive…

形式语言与自动机理论 · 计算机科学 2019-12-18 Štěpán Holub

We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.

几何拓扑 · 数学 2016-05-31 Khaled Qazaqzeh , Ayman Aboufattoum , Kyle Istvan

We revisit the question of classification of balanced circular words and focus on the case of a ternary alphabet. We propose a $3$-dimensional generalisation of the discrete approximation representation of Christoffel words. By considering…

组合数学 · 数学 2021-05-03 D. V. Bulgakova , N. Buzhinsky , Y. O. Goncharov

We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$…

动力系统 · 数学 2008-09-16 Shigeki Akiyama , Horst Brunotte , Attila Petho , Wolfgang Steiner

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

交换代数 · 数学 2016-04-01 Chiara Marcolla , Emmanuela Orsini , Massimiliano Sala

In this paper we quantify the consistency of word usage in written texts represented by complex networks, where words were taken as nodes, by measuring the degree of preservation of the node neighborhood.} Words were considered highly…

物理与社会 · 物理学 2013-02-19 Diego R. Amancio , Osvaldo N. Oliveira , Luciano da F. Costa

We investigate from a statistical perspective the arithmetic properties of the dynamics of polynomials of fixed degree and defined over the field of rational numbers. To start with, ordering their affine conjugacy classes by height, we show…

数论 · 数学 2021-12-23 Pierre Le Boudec , Niki Myrto Mavraki

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke (NAND) and Peirce's…

逻辑 · 数学 2017-10-27 Richard Zach

Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the…

组合数学 · 数学 2024-06-25 Mélodie Lapointe , Nathan Plourde-Hébert

Let X be an affine variety and L be a solvable Lie subalgebra of Lie(Aut(X)) generated by a finite collection of locally finite Lie subalgebras. The authors of [arXiv:2507.09679] wondered whether L is itself locally finite. Here we present…

代数几何 · 数学 2026-05-26 Mikhail Zaidenberg

We discuss the relationship between discrete-time processes (chains) and one-dimensional Gibbs measures. We consider finite-alphabet (finite-spin) systems, possibly with a grammar (exclusion rule). We establish conditions for a stochastic…

概率论 · 数学 2007-05-23 Roberto Fernandez , Gregory Maillard

A palindromic periodicity is a factor of an infinite word $(ps)^\omega$ where $p$ and $s$ are palindromes and the factor has length at least $|ps|$, for example, $accabaccab$. In this paper we describe several ways in which a palindromic…

组合数学 · 数学 2024-05-02 Jamie Simpson

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

代数几何 · 数学 2024-12-31 Laura Escobar , Megumi Harada , Christopher Manon

The standard series expansion for the period of a finite amplitude pendulum as a function of energy (and hence amplitude) provides a lower limit on the period when the series is truncated. An adjustment to the last term in the truncated…

经典物理 · 物理学 2007-07-09 Ian R. Gatland

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

组合数学 · 数学 2025-08-26 Be'eri Greenfeld , Carlos Gustavo Moreira , Efim Zelmanov