相关论文: On periodicity of generalized pseudostandard words

We show the first unconditional pseudo-determinism result for all of search-BPP. Specifically, we show that every BPP search problem can be computed pseudo-deterministically on average for infinitely many input lengths. In other words, for…

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…

We discuss a new stochastic ordering for the sequence of independent random variables. It generalizes the stochastic precedence order that is defined for two random variables to the case $n>2$. All conventional stochastic orders are…

The problem of finding a (continuous) utility function for a semiorder has been studied since in 1956 R.D. Luce introduced in \emph{Econometrica} the notion. There was almost no results on the continuity of the representation. A similar…

We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…

The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical…

We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higher-dimensional analogues) to be studied are linearly repetitive, repulsive and power free. Since then,…

The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is…

In 1909 Borel defined normality as a notion of randomness of the digits of the representation of a real number over certain base (fractional expansion). If we think the representation of a number over a base as an infinite sequence of…

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…

We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

This article studies the global hypoellipticity of a class of overdetermined systems of pseudo-differential operators defined on the torus. The main goal consists in establishing connections between the global hypoellipticity of the system…

We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words.…

Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…

The definition of a pseudo-dualizing complex is obtained from that of a dualizing complex by dropping the injective dimension condition, while retaining the finite generatedness and homothety isomorphism conditions. In the specific setting…

This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…

We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…