Related papers: Minimal clones with many majority operations
We discuss the log minimal model theory for log surfaces. We show that the log minimal model program, the finite generation of log canonical rings, and the log abundance theorem for log surfaces hold true under assumptions weaker than the…
We discuss the relative log minimal model theory for log surfaces in the analytic setting. More precisely, we show that the minimal model program, the abundance theorem, and the finite generation of log canonical rings hold for log pairs of…
We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.
Minimal thinness is a notion that describes the smallness of a set at a boundary point. In this paper, we provide tests for minimal thinness for a large class of subordinate killed Brownian motions in bounded C1,1 domains, C1,1 domains with…
We give an explicit description of all 168 quartic curves over the field of two elements that are isomorphic to the Klein curve over an algebraic extension. Some of the curves have been known for their small class number, others for…
We establish the best possible approximation to a perfect quantum cloning machine which produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for…
We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.
We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…
We discuss the action of a subgroup on small nilpotent orbits, and prove a bounded multiplicity property for the restriction of minimal representations of real reductive Lie groups with respect to arbitrary reductive symmetric pairs.
It is known that there are infinite words over finite alphabets with Abelian repetition threshold arbitrarily close to 1; however, the construction previously used involves huge alphabets. In this note we give a short cyclic morphism…
We provide bounds on the compression size of the solutions to 22 problems in computer science. For each problem, we show that solutions exist with high probability, for some simple probability measure. Once this is proven, derandomization…
$\mathit{C}$-clones are polymorphism sets of so-called clausal relations, a special type of relations on a finite domain, which first appeared in connection with constraint satisfaction problems in [Creignou et al. 2008]. We completely…
We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger.…
We study some examples of minimal length curves in homogeneous spaces of B(H) under a left action of a unitary group. Recent results relate these curves with the existence of minimal (with respect to a quotient norm) anti-Hermitian…
We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…
In 1978, Allan.Wm.Johnson obtained an example of the representation of 1 by the sum of reciprocals of the product of two distinct prime numbers. His example has 48 terms [1], and we had no examples which have less than 48 terms until now.…
Detecting code clones is relevant to software maintenance and code refactoring. This challenge still presents unresolved cases, mainly when structural similarity does not reflect functional equivalence, though recent code models show…
Rigid graphs have only finitely many realizations. In the recent years significant progress was made in computing the number of such realizations. With this progress it was also possible for the first time to do computations on large sets…
Spinons are among the generic excitations in one-dimensional spin systems, they can be massless or massive. The quantitative description of massive spinons poses a considerable challenge in spite of various variational approaches. We show…
We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…