Related papers: Sets Have Simple Members
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…
The fine approach to measure information dependence is based on the total conditional complexity CT(y|x), which is defined as the minimal length of a total program that outputs y on the input x. It is known that the total conditional…
In this master thesis we analyze the complexity of sorting a set of strings. It was shown that the complexity of sorting strings can be naturally expressed in terms of the prefix trie induced by the set of strings. The model of computation…
Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…
There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
We explore the distribution of class numbers $h(d)$ of indefinite binary quadratic forms, for discriminants $d$ such that the corresponding fundamental unit $\varepsilon_d$ is lower than $d^{1/2+\alpha}$, where $0<\alpha<1/2$. To do so we…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…
The complexity of a system, in general, makes it difficult to determine some or almost all matrix elements of its operators. The lack of accuracy acts as a source of randomness for the matrix elements which are also subjected to an external…
In this paper we introduce and study a new complexity measure for finite words. For positive integer $d$ special scattered subwords, called super-$d$-subwords, in which the gaps are of length at least $(d-1)$, are defined. We give methods…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
Given a random process $x(\tau)$ which undergoes stochastic resetting at a constant rate $r$ to a position drawn from a distribution ${\cal P}(x)$, we consider a sequence of dynamical observables $A_1, \dots, A_n$ associated to the…
We compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
For positive integers N and d, there are only finite number of conical symplectic varieties of dimension 2d with maximal weights N, up to isomorphism. The maximal weight of a conical symplectic variety X is, by definition, the maximal…
We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by…
Kolmogorov suggested to measure quality of a statistical hypothesis $P$ for a data $x$ by two parameters: Kolmogorov complexity $C(P)$ of the hypothesis and the probability $P(x)$ of $x$ with respect to $P$. P. G\'acs, J. Tromp, P.M.B.…