Related papers: Twists and Twistability
We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(\kappa,{\lambda} )$ bipartite graph is a bipartite graph with left side of size…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…
We define group-twisted Alexander-Whitney and Eilenberg-Zilber maps for converting between bimodule resolutions of skew group algebras. These algebras are the natural semidirect products recording actions of finite groups by automorphisms.…
Graph-walking automata (GWA) are a model for graph traversal using finite-state control: these automata move between the nodes of an input graph, following its edges. This paper investigates the effect of node-replacement graph…
Let $G$ be a linear connected complex reductive Lie group. The purpose of this paper is to give explicit symplectic isomorphisms from twisted cotangent bundles of the complex generalized flag varieties, whose transition functions are given…
We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…
Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to…
Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. Here we consider a class of countable metrically homogeneous graphs. The algebra of an age is a concept…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
In connection with Rokhlin's question on an automorphism with a homogeneous nonsimple spectrum, we indicate a class of measure-preserving maps $T$ such that $T\times T$ has a homogeneous spectrum of multiplicity 2. The automorphisms in…
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More…
The quantum geometry arising in Loop Quantum Gravity has been known to semi-classically lead to generalizations of length-geometries. There have been several attempts to interpret these so called twisted geometries and understand their role…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a…