Related papers: Short note on additive sequences and on recursive …
We analyze a general class of reversible aggregate-reorganization processes. These processes are shown to exhibit globally attracting equilibrium distributions, which are \textit{universal}, i.e. identical for large classes of models.…
In this article we study $p$-adic properties of sequences of integers (or $p$-adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we give an explicit approximate twisted interpolation to $\mathbb…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules. Here we give a structured list of most rules that have been proposed and…
We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…
We consider existential rules (aka Datalog+) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
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 assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical…
I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…
We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be…
We pursue the investigation of generalizations of the Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a finite word appears as a subsequence of another finite word. The finite…
Properties of universality have essential relevance for the theory of random matrices usually called the Wigner ensemble. The issue was analysed up to recent years with detailed and relevant results. We present a slightly different view and…
Poincar\'e recurrence theorem implies the density of recurrent points for volume-preserving dynamical systems on compact domains. The density of closed orbits in the non-wandering set is one of the essential properties of Axiom A and chaos.…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
There are many scientific problems generated by the multiple and conflicting alternative definitions of linguistic recursion and human recursive processing that exist in the literature. The purpose of this article is to make available to…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…