English
Related papers

Related papers: Sturm palindrome substitution criterion

200 papers

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

Logic · Mathematics 2016-05-20 B. van den Berg , E. M. Briseid , P. Safarik

There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). One way to…

Machine Learning · Computer Science 2013-10-21 Peter D. Turney

We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.

Combinatorics · Mathematics 2026-04-01 Ľubomíra Dvořáková , Lucas Mol , Pascal Ochem

Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem…

Combinatorics · Mathematics 2019-05-17 Amritanshu Prasad

In 1999 Lyngs{\o} and Pedersen proposed a conjecture stating that every binary circular word of length $n$ with equal number of zeros and ones has an antipalindromic linear subsequence of length at least $\frac{2}{3}n$. No progress over a…

Formal Languages and Automata Theory · Computer Science 2019-01-23 Clemens Müllner , Andrew Ryzhikov

Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to morphisms fixing words coding non-degenerate three interval…

Combinatorics · Mathematics 2016-06-21 Zuzana Masáková , Edita Pelantová , Štěpán Starosta

The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…

Probability · Mathematics 2022-08-04 Friedrich Götze , Andrei Yu. Zaitsev

In 2013, Fici and Zamboni proved a number of theorems about finite and infinite words having only a small number of factors that are palindromes. In this paper we rederive some of their results, and obtain some new ones, by a different…

Formal Languages and Automata Theory · Computer Science 2020-01-07 Lukas Fleischer , Jeffrey Shallit

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

Let $S(X,B)$ be a symmetric (``palindromic'') word in two letters $X$ and $B$. A theorem due to Hillar and Johnson states that for each pair of positive definite matrices $B$ and $P$, there is a positive definite solution $X$ to the word…

Operator Algebras · Mathematics 2007-05-23 Scott N. Armstrong , Christopher J. Hillar

Using the canonical transformation of the order parameter which restores the Ising symmetry of the Hamiltonian we derive the expression for the Tolman length as a sum of two terms. One of them is the term generated by the fluctuations of…

Statistical Mechanics · Physics 2007-05-23 V. L. Kulinskii

We propose in this paper a method for measuring the similarity between ontological concepts and terms. Our metric can take into account not only the common words of two strings to compare but also other features such as the position of the…

Information Retrieval · Computer Science 2013-07-25 Van Tien Nguyen , Christian Sallaberry , Mauro Gaio

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…

Probability · Mathematics 2016-08-16 Raphaël Rossignol

Comments are made on some recently published papers on matter collineations of plane symmetric, cylindrically symmetric and spherically symmetric spacetimes.

General Relativity and Quantum Cosmology · Physics 2015-05-18 Asghar Qadir , K. Saifullah

We consider the problem of inference on the signs of $n>1$ parameters. We aim to provide $1-\alpha$ post-hoc confidence bounds on the number of positive and negative (or non-positive) parameters. The guarantee is simultaneous, for all…

Methodology · Statistics 2024-03-05 Ruth Heller , Aldo Solari

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz

In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…

Combinatorics · Mathematics 2014-11-17 Émilie Charlier , Teturo Kamae , Svetlana Puzynina , Luca Q. Zamboni

In this paper the sufficient conditions for convergence in Skorokhod space $D[0,1]$ of sequence of random processes with random time substitution are obtained.

Probability · Mathematics 2010-01-21 Elena Permyakova

We supplement the result of the first part of the work with estimates of the integrals of the difference of subharmonic functions in measure with some deterioration of the absolute constants, but these estimates have the form of a…

Complex Variables · Mathematics 2021-07-13 B. N. Khabibullin

We explain and restate the results from our recent paper arXiv:1503.08000.v3 in standard language for substitutions and $S$-adic systems in symbolic dynamics. We then produce as rather direct application an $S$-adic system (with finite set…

Dynamical Systems · Mathematics 2024-10-03 Nicolas Bédaride , Arnaud Hilion , Martin Lustig