Related papers: Generating clones with conservative near-unanimity…

We introduce a higher-arity stability notion defined in terms of $k$-splitting, a higher-arity generalization of splitting. We show that theories with bounded $k$-splitting have improved indiscernible extraction at $k$-ineffable cardinals,…

We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We…

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of…

Answering a question of Goode, we show that $k$-triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our…

There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…

We show that for all $1<k \leq \log n$ the $k$-ary unbiased black-box complexity of the $n$-dimensional $\onemax$ function class is $O(n/k)$. This indicates that the power of higher arity operators is much stronger than what the previous…

Let $k$ be a number field, suppose that $B$ is a central simple division algebra over $k$, and choose any maximal order $\mathcal{D}$ of $B$. The object of this paper is to show that the group $\mathcal{D}_S^*$ of $S$-units of $B$ is…

If $G=(V_G, E_G)$ is a graph, then $S\subseteq V_G$ is a global defensive $k$-alliance in $G$ if (i) each vertex not in $S$ has a neighbor in $S$ and (ii) each vertex of $S$ has at least $k$ more neighbors inside $S$ than outside of it. The…

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly…

Answering a question of Cameron, Pretzel and Siemons proved that every integer partition of $n\ge 2(k+3)(k+1)$ can be reconstructed from its set of $k$-deletions. We describe a new reconstruction algorithm that lowers this bound to $n\ge…

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of…

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Given query access to an undirected graph $G$, we consider the problem of computing a $(1\pm\epsilon)$-approximation of the number of $k$-cliques in $G$. The standard query model for general graphs allows for degree queries, neighbor…

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Let R be an affine PI-algebra over an algebraically closed field k and let G be an affine algebraic k-group that acts rationally by algebra automorphisms on R. For R prime and G a torus, we show that R has only finitely many G-prime ideals…

We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory-Johnson setting as well as a recent extension by Cornu\'ejols and Y{\i}ld{\i}z. We show that…

We derive a lower bound for the optimal fidelity for deterministic cloning a set of n pure states. In connection with states estimation, we obtain a lower bound about average maximum correct states estimation probability.