English
Related papers

Related papers: Generating clones with conservative near-unanimity…

200 papers

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

Numerical Analysis · Mathematics 2023-08-24 Matthew Streeter , Joshua V. Dillon

In 1986, the second author classified the minimal clones on a finite universe into five types. We extend this classification to infinite universes and to multiclones. We show that every non-trivial clone contains a "small" clone of one of…

Logic · Mathematics 2007-05-23 Maurice Pouzet , Ivo G. Rosenberg

For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k=l=3 with a sharp bound. A similar…

Combinatorics · Mathematics 2014-02-19 Nati Linial , Avraham Morgenstern

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

Rings and Algebras · Mathematics 2016-11-22 Erkko Lehtonen , Ágnes Szendrei

We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…

Group Theory · Mathematics 2024-03-27 Jason Fulman , Daniele Garzoni , Robert M. Guralnick

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Representation Theory · Mathematics 2007-05-23 Jeb F. Willenbring , Gregg J. Zuckerman

We show that one can deterministically generate out of $N$ copies of an unknown unitary operation up to $N^2$ almost perfect copies. The result holds for all operations generated by a Hamiltonian with an unknown interaction strength. This…

Quantum Physics · Physics 2015-05-07 W. Dür , P. Sekatski , M. Skotiniotis

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\mathbf{2} := \{0,1\}$, the set $\mathcal{I}(C)$ of all partial clones on $\mathbf{2}$ whose total component is $C$, is either finite or…

Rings and Algebras · Mathematics 2014-01-23 Karsten Schölzel

Let A be a finite non-singleton set. For |A|=2 we show that the partial clone consisting of all selfdual monotone partial functions on A is not finitely generated, while it is the intersection of two finitely generated maximal partial…

Rings and Algebras · Mathematics 2009-11-03 Miguel Couceiro , Lucien Haddad

We show that every finite Abelian algebra A from congruence-permutable varieties admits a full duality. In the process, we prove that A also allows a strong duality, and that the duality may be induced by a dualizing structure of finite…

Rings and Algebras · Mathematics 2015-03-18 Wolfram Bentz , Pierre Gillibert , Luís Sequeira

Dmitriy Zhuk has proved that there exist relational structures which admit near-unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches the known upper bounds. We present a simplified and explicit…

Logic · Mathematics 2017-12-06 Libor Barto , Ondřej Draganov

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

Rings and Algebras · Mathematics 2011-02-11 Tamás Waldhauser

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

Combinatorics · Mathematics 2020-06-30 Nati Linial , Michael Simkin

A $k$-free like group is a $k$-generated group $G$ with a sequence of $k$-element generating sets $Z_n$ such that the girth of $G$ relative to $Z_n$ is unbounded and the Cheeger constant of $G$ relative to $Z_n$ is bounded away from 0. By a…

Group Theory · Mathematics 2008-11-12 A. Yu. Olshanskii , M. V. Sapir

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

Rings and Algebras · Mathematics 2020-09-17 Alexandr Kazda , Dmitriy Zhuk

Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the associative spectrum, the other one uses the index of…

Rings and Algebras · Mathematics 2011-02-11 Tamás Waldhauser

Let $K$ be the function field of a smooth and proper curve $S$ over an algebraically closed field $k$ of characteristic $p>0$. Let $A$ be an ordinary abelian variety over $K$. Suppose that the N\'eron model $\CA$ of $A$ over $S$ has a…

Algebraic Geometry · Mathematics 2012-11-30 Damian Rössler

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Commutative Algebra · Mathematics 2025-09-23 Andrei Mandelshtam

We prove that the log canonical ring of a klt pair of dimension $3$ with $\mathbb{Q}$-boundary over an algebraically closed field of characteristic $p>5$ is finitely generated. In the process we prove log abundance for such pairs in the…

Algebraic Geometry · Mathematics 2016-05-02 Joe Waldron