Related papers: Almost all Cayley maps are mapical regular represe…
In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these…
A graph on $n$ vertices is said to be \emph{$C$-Ramsey} if every clique or independent set of the graph has size at most $C \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed…
We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…
The notion of quadratic maps between arbitrary groups appeared at several places in the literature on quadratic algebra. Here a unified extensive treatment of their properties is given; the relation with a relative version of Passi's…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
In this paper, we construct and study derived character maps of finite-dimensional representations of $\infty$-groups. As models for $\infty$-groups we take homotopy simplicial groups, i.e. homotopy simplicial algebras over the algebraic…
We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}_3^d$ that admit uniform mixing at time…
We study the dynamics of piecewise conformal maps in the Riemann sphere. The normality and chaotic regions are defined and we state several results and properties of these sets. We show that the stability of these piecewise maps is related…
A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a…
In this paper we study random induced subgraphs of Cayley graphs of the symmetric group induced by an arbitrary minimal generating set of transpositions. A random induced subgraph of this Cayley graph is obtained by selecting permutations…
We say that a group G is a cube group if it is generated by a set S of involutions such that the corresponding Cayley graph Cay(G,S) is isomorphic to a cube. Equivalently, G is a cube group if it acts on a cube such that the action is…
As a main result of this paper we give conditions under which the generalized $X$-join of Cayley graphs is a Cayley graph. In particular, we show that $X$-join of isomorphic Cayley graphs is a Cayley grpah. To do this, new properties for a…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
We introduce and analyze the concept of an assembly map from the original homotopy theoretic point of view. We give also interpretations in terms of surgery theory, controlled topology and index theory. The motivation is that prominent…
In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…
A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
When the quotient of a symplectic vector space by the action of a finite subgroup of symplectic automorphisms admits as a crepant projective resolution of singularities the Hilbert scheme of regular orbits of Nakamura, then there is a…
We describe the mathematical properties of pairwise comparisons matrices with coefficients in an arbitrary group. We provide a vocabulary adapted for the description of main algebraic properties of inconsistency maps, describe an example…