Related papers: Generating clones with conservative near-unanimity…
An almost PI algebra is a generalisation of a just infinite algebra which does not satisfy a polynomial identity. An almost PI algebra has some nice properties: It is prime, has a countable cofinal subset of ideals and when satisfying…
A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study…
Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…
The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…
In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…
Perfect cloning of a known set of states with arbitrary prior probabilities is possible if we allow the cloner to sometimes fail completely. In the optimal case the probability of failure is at its minimum allowed by the laws of quantum…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…
Given a connected graph $G=(V,E)$, a set $S\subseteq V$ is a $k$-metric generator for $G$ if for any two different vertices $u,v\in V$, there exist at least $k$ vertices $w_1,...,w_k\in S$ such that $d_G(u,w_i)\ne d_G(v,w_i)$ for every…
By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…
In the paper we introduce a notion of a key relation, which is similar to the notion of a critical relation introduced by Keith A.Kearnes and \'Agnes Szendrei. All clones on finite sets can be defined by only key relations. In addition…
The {\it number rigidity} of a stationary point process $\mathsf{P}$ entails that for a bounded set $A$ the knowledge of $\mathsf{P}$ on $A^{c}$ a.s. determines $\mathsf{P}(A)$; the $k$-order rigidity means the moments of $\mathsf{P}1_{A}$…
Let (X, g, J, f ) be a non-compact gradient shrinking Kahler-Ricci soliton. We prove that if the scalar curvature of X satisfies a mild assumption, then OP (X), the ring of holomorphic functions with polynomial growth on X, is finitely…
We show that a finitely generated soluble group is virtually nilpotent if and only if the diameter of its finite coset spaces admits a uniform polynomial lower bound in terms of their size. We obtain the same conclusion for certain finitely…
Let $K$ be a field with a discrete valuation, and let $p$ be a prime. It is known that if $\Gamma \lhd \Gamma_0 < \mathrm{PGL}_2(K)$ is a Schottky group normally contained in a larger group which is generated by order-$p$ elements each…
We show that up to commensurability there are only finitely many cocompact arithmetic Kleinian groups generated by rotations. This implies, in particular, that there exist only finitely many conjugacy classes of cocompact two generated…
Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.