Related papers: The conjugacy problem for automorphism groups of h…
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…
The following optimization problem was introduced in \cite{gutinDAM}, where it was motivated by a real-world problem in defence logistics. Suppose we are given a pair of digraphs $D,H$ and a positive cost $c_i(u)$ for each $u\in V(D)$ and…
We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
It is proven in the paper, that Carter subgroups of a finite group are conjugate if Carter subgroups in the group of induced automorphisms for every non-Abelian composition factor are conjugate.
We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…
We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…
We study graph-directed conjugate functional equations on the unit interval indexed by the complete digraph with self-loops on two vertices. We focus on the singularity and regularity of the solutions for compatible systems of weak…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous countable structures. We first consider the existence of dense conjugacy classes (the topological Rokhlin property).…
First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…
The concept of an omnigenous locally finite group was introduced in [2] as a generalization of Hall's universal countable locally finite group. In this paper we show that the class of all countable omnigenous locally finite groups is Borel…
Let $M$ be a locally symmetric irreducible closed manifold of dimension $\ge 3$. A result of Borel [Bo] combined with Mostow rigidity imply that there exists a finite group $G = G(M)$ such that any finite subgroup of $\text{Homeo}^+(M)$ is…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
We study topological groups of monotonic autohomeomorphisms on a generalized ordered space $L$. We find a condition that is necessary and sufficient for the set of all monotonic autohomeomorphisms on $L$ along with the function composition…
We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…