Related papers: Two- and three-cocycles for Laver tables
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We review several techniques that twist an algebra's multiplicative structure. We first consider twists by an automorphism, also known as Zhang twists, and we relate them to 2-cocycle twists of certain bialgebras. We then outline the…
In this paper, we study three classes of subvarieties inside the variety of left-symmetric algebras. We show that these subvarieties are naturally related to some well-known varieties, such as alternative, assosymmetric and Zinbiel…
One of the major problems in the structural theory of skew braces consists in the classification of skew braces of finite order up to isomorphism. In this light, the open question of the existence of a Cauchy theorem for finite skew braces…
We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…
We consider uniformly strongly elliptic systems of the second order with bounded coefficients. First, sufficient conditions for the invariance of convex bodies obtained for linear systems without zero order term in bounded domains and…
To a tree of semi-simple algebras we associate a qurve (or formally smooth algebra) S. We introduce a Zariski- and etale quiver describing the finite dimensional representations of S. In particular, we show that all quotient varieties of…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…
The normal form theorem, proved in R. Laver, On the left distributive law and the freeness of an algebra of elementary embeddings, Advances in Mathematics 91 (1992), 209-231, for the free algebra $\Cal A$ on one generator $x$ satisfying the…
We introduce the notion of omni-Lie 2-algebra, which is a categorification of Weinstein's omni-Lie algebras. We prove that there is a one-to-one correspondence between strict Lie 2-algebra structures on 2-sub-vector spaces of a 2-vector…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
We construct a new family of infinite-dimensional quasi-graded Lie algebras on hyperelliptic curves. We show that constructed algebras possess infinite number of invariant functions and admit a decomposition into the direct sum of two…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a…
In the study of NIL-affine actions on nilpotent Lie groups we introduced so called LR-structures on Lie algebras. The aim of this paper is to consider the existence question of LR-structures, and to start a structure theory of LR-algebras.…
We construct a convenient basis for all real semisimple Lie algebras by means of an adapted Chevalley basis of the complexification. It determines rational and in fact half-integer structure constants which we express only in terms of the…
We give a novel descriptive-complexity theoretic characterization of L and NL computable queries over finite structures using traversal invariance. We summarize this as (N)L = FO + (breadth-first) traversal-invariance.