Related papers: A note on the Burris-Willard conjecture

Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…

Due to the Baker-Pixley theorem we know that every clone over a finite domain $A$ containing a near-unanimity operation $g$ is finitely generated. Therefore there exists an integer $k$ such that the clone is generated by its $k$-ary part.…

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 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

Nov\'{a}k conjectured in 1974 that for any cyclic Steiner triple systems of order $v$ with $v\equiv 1\pmod{6}$, it is always possible to choose one block from each block orbit so that the chosen blocks are pairwise disjoint. We consider the…

Let $(H_{\mathbf{R}}, U_t)$ be any strongly continuous orthogonal representation of $\mathbf{R}$ on a real (separable) Hilbert space $H_{\mathbf{R}}$. For any $q\in (-1,1)$, we denote by $\Gamma_q(H_{\mathbf{R}},U_t)^{\prime\prime}$ the…

A central open question in extremal design theory is Nash-Williams' Conjecture from 1970 that every $K_3$-divisible graph on $n$ vertices (for $n$ large enough) with minimum degree at least $3n/4$ has a $K_3$-decomposition. A folklore…

In 1967, Kadison asked "if $N$ is a subfactor of the factor $M$ for which $N' \cap M$ consists of scalars, will some maximal abelian *-subalgebra of $N$ be a maximal abelian subalgebra of $M$?". Generalizing a theorem of Popa in the type…

We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…

Let $G$ be a locally finite group and $F(G)$ the Hirsch--Plotkin radical of $G$. Denote by $S$ the full inverse image of the generalized Fitting subgroup of $G/F(G)$ in $G$. Assume that there is a number $k$ such that the length of every…

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…

The $q$-Onsager algebra $\mathcal O_q$ is defined by two generators $W_0, W_1$ and two relations called the $q$-Dolan/Grady relations. Recently Baseilhac and Kolb obtained a PBW basis for $\mathcal O_q$ with elements denoted $\lbrace B_{n…

In 2014, Keevash famously proved the existence of $(n,q,r)$-Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid-1800s). In 2020, Glock, K\"uhn, and Osthus conjectured a minimum degree…

We introduce a new family of affine $W$-algebras associated with the centralizers of arbitrary nilpotent elements in $\mathfrak{gl}_N$. We define them by using a version of the BRST complex of the quantum Drinfeld--Sokolov reduction. A…

The main problem of clone theory is to describe the clone lattice for a given basic set. For a two-element basic set this was resolved by E.L. Post, but for at least three-element basic set the full structure of the lattice is still…

Sidorenko's Conjecture says that the minimum density of a bigraph $G$ in a bigraphon $W$ of a given edge density is attained when $W$ is a constant function. A consequence of a result by B. Szegedy is that it is enough to show Sidorenko's…

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kazi{\'o}w in 2012, is true. Namely, for every connected graph with order at least 3, we prove that we can assign labels 1,2,3 to the edges in such a way that no…