Related papers: On Almost Periodicity Criteria for Morphic Sequenc…

We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…

We study the almost sure convergence of randomly truncated stochastic algorithms. We present a new convergence theorem which extends the already known results by making vanish the classical condition on the noise terms. The aim of this work…

We introduce a quantitative condition on orbits of dynamical systems which measures their aperiodicity. We show the existence of sequences in the Bernoulli-shift and geodesics on closed hyperbolic manifolds which are as aperiodic as…

The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it…

This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…

Tropical recurrent sequences are introduced satisfying a given vector (being a tropical counterpart of classical linear recurrent sequences). We consider the case when Newton polygon of the vector has a single (bounded) edge. In this case…

The aim of this article is to obtain a better understanding and classification of strictly ergodic topological dynamical systems with discrete spectrum. To that end, we first determine when an isomorphic maximal equicontinuous factor map of…

In this paper we investigate the properties of the set of T-periodic solutions of semi-explicit parametrized Differential-Algebraic Equations with non-autonomous constraints of a particular type. We provide simple, degree theoretic…

Mechanisms are elucidated underlying the existence of dynamical systems whose generic solutions approach asymptotically (at large time) isochronous evolutions: all their dependent variables tend asymptotically to functions periodic with the…

The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…

In many dynamical systems, countably infinitely many invariant tori co-exist. The occurrence of quasiperiodicity on any one of these tori is sometimes sufficient to establish strong global properties, like dense trajectories and periodic…

Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…

An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this paper we propose polynomial time approximate and exponential…

We prove a criteria for uniform hyperbolicity based on the periodic points of the transformation. More precisely, if a mild (non uniform) hyperbolicity condition holds for the periodic points of any diffeomorphism in a residual subset of a…

We prove a quantitative, large-scale doubling inequality and large-scale three-ellipsoid inequality for solutions of uniformly elliptic equations with periodic coefficients. These estimates are optimal in terms of the minimal length scale…

We report on new techniques and results in the regularity theory of general non-uniformly elliptic variational integrals. By means of a new potential theoretic approach we reproduce, in the non-uniformly elliptic setting, the optimal…

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

In this paper, we will discuss the notion of almost orthogonality in a functional sequence.Especially, we will define a few sequences of almost orthogonal polynomials which can be used successfully for modeling of electronic systems which…

We obtain some existence theorems for periodic solutions to several linear equations involving fractional Laplacian. We also prove that the lower bound of all periods for semilinear elliptic equations involving fractional Laplacian is not…