Related papers: Towards a characterization of the star-free sets o…

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

Suppose that $X$ is a projective variety over an algebraically closed field of characteristic $p > 0$. Further suppose that $L$ is an ample (or more generally in some sense positive) divisor. We study a natural linear system in $|K_X + L|$.…

In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

Let $x$ be a positive real number, and $\mathcal{P} \subset [2,\lambda(x)]$ be a set of primes, where $\lambda(x) \in \Omega(x^\varepsilon)$ is a monotone increasing function with $\varepsilon \in (0,1)$. We examine $Q_{\mathcal{P}}(x)$,…

Let O be the ring of integers of a number field K. For an O-algebra R which is torsion free as an O-module we define what we mean by a Lambda_O-ring structure on R. We can determine whether a finite etale K-algebra E with Lambda_O-ring…

For testing goodness of fit, we consider a class of U-statistics of overlapping spacings of order two, and investigate their asymptotic properties. The standard U-statistic theory is not directly applicable here as the overlapping spacings…

In 2011 Deshouillers and Ruzsa tried to argument that the sequence of the last nonzero digit of $n!$ in base 12 is not automatic. This statement was proved few years later by Deshoulliers. In this paper we provide alternate proof that lets…

Given a topological property $\mathcal{P}$, a space $X$ is called star-$\mathcal{P}$ if for any open cover $\mathcal{U}$ of the space $X$, there exists a set $Y\subseteq X$ with property $\mathcal{P}$ such that $St(Y,\mathcal{U})=X$; the…

We establish a hierarchy of Euclidean stars according to their degree of complexity, as measured by the complexity factor and the complexity of the pattern of evolution. We consider both, nondissipative and dissipative systems. Solutions…

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

We characterize those $k$-automatic sets $S$ of natural numbers that form an additive basis for the natural numbers, and we show that this characterization is effective. In addition, we give an algorithm to determine the smallest $j$ such…

The stable index of a 0-1 matrix $A$ is defined to be the smallest integer $k$ such that $A^{k+1}$ is not a 0-1 matrix if such an integer exists; otherwise the stable index of $A$ is defined to be infinity. We characterize the set of stable…

A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…

A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is…

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…