Related papers: On the Descriptive Complexity of Groups without Ab…

In 2008, the author proposed a version of duality theory for (not necessarily, Abelian) complex Lie groups, based on the idea of using the Arens-Michael envelope of topological algebra and having an advantage over existing theories in that…

Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to…

Given an abelian algebraic group $A$ over a global field $F$, $\alpha \in A(F)$, and a prime $\ell$, the set of all preimages of $\alpha$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion…

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…

We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

Let $G$ be a simple algebraic group. A closed subgroup $H$ of $G$ is called spherical provided it has a dense orbit on the flag variety $G/B$ of $G$. Reductive spherical subgroups of simple Lie groups were classified by Kr\"amer in 1979. In…

We show that bi-flat $F$-manifolds can be interpreted as natural geometrical structures encoding the almost duality for Frobenius manifolds without metric. Using this framework, we extend Dubrovin's duality between orbit spaces of Coxeter…

Given a pair of graphs $\textbf{A}$ and $\textbf{B}$, the problems of deciding whether there exists either a homomorphism or an isomorphism from $\textbf{A}$ to $\textbf{B}$ have received a lot of attention. While graph homomorphism is…

If G is a finite group and k is a field, there is a natural construction of a Hopf algebra over k associated to G, the Drinfel'd double D(G). We prove that if G is any finite real reflection group with Drinfel'd double D(G) over an…

We introduce extensions of the multidimensional Heisenberg group $\mathbb{H}^n$ by two-parameter groups of dilations, and then classify the extended groups up to isomorphism, by employing Lie algebra techniques. We show that the groups are…

We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$…

We prove that finite groups have the same complex character tables iff the group algebras are twisted forms of each other as Drinfel'd quasi-bialgebras or iff there is non-associative bi-Galois algebra over these groups. The interpretations…

Balliu et al. (DISC 2020) classified the hardness of solving binary labeling problems with distributed graph algorithms; in these problems the task is to select a subset of edges in a $2$-colored tree in which white nodes of degree $d$ and…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Given a finite group $G$, we say that $G$ has weak normal covering number $\gamma_w(G)$ if $\gamma_w(G)$ is the smallest integer with $G$ admitting proper subgroups $H_1,\ldots,H_{\gamma_w(G)}$ such that each element of $G$ has a conjugate…

Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version asking for sets of variables as…

In 1965, Erd\H{o}s and P\'{o}sa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter…

The Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler-Leman algorithm, evaluate local…

We investigate deformations of a skew group algebra that arise from a finite group acting on a polynomial ring. When the characteristic of the underlying field divides the order of the group, a new type of deformation emerges that does not…