Related papers: A class of highly symmetric Archdeacon embeddings
We develop a new approach to the classical problem on isotopy classification of embeddings of manifolds into Euclidean spaces. This approach involves studying of a new embedding invariant, of almost-embeddings and of smoothing, as well as…
We present an application of the program of groupoidification leading up to a sketch of a categorification of the Hecke algebroid --- the category of permutation representations of a finite group. As an immediate consequence, we obtain a…
In this paper we introduce a particular class of Heffter arrays, called globally simple Heffter arrays, whose existence gives at once orthogonal cyclic cycle decompositions of the complete graph and of the cocktail party graph. In…
This work deals with relations between a bounded cohomological invariant and the geometry of Hermitian symmetric spaces of noncompact type. The invariant, obtained from the K\"ahler class, is used to define and characterize a special class…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
Linear hypersurfaces over a field $k$ have been playing a central role in the study of some of the challenging problems on affine spaces. Breakthroughs on such problems have occurred by examining two difficult questions on linear…
Grothendieck's dessins d'enfants arise with ever-increasing frequency in many areas of 21st century mathematical physics. In this paper, we review the connections between dessins and the theory of Hecke groups. Focussing on the restricted…
A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$.…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
The notion of a Heffter array, which received much attention in the last decade, is equivalent to a pair of orthogonal Heffter systems. In this paper we study the existence problem of a set of $r$ mutually orthogonal Heffter systems for any…
Consider the following classes of pairs consisting of a group and a finite collection of subgroups: $\mathcal{C}= \left\{ (G,\mathcal H) \mid \text{$\mathcal{H}$ is hyperbolically embedded in $G$} \right\}$ and $ \mathcal{D}= \left\{…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
Zooplankton images, like many other real world data types, have intrinsic properties that make the design of effective classification systems difficult. For instance, the number of classes encountered in practical settings is potentially…
We prove a theorem relating the automorphism group of a Cartan geometry to the group on which the geometry is modeled: a component of the adjoint representation of the first embeds in the adjoint representation of the second. Consequences…
We prove that every smooth affine variety of dimension $d$ embeds into every simple algebraic group of dimension at least $2d+2$. We do this by establishing the existence of embeddings of smooth affine varieties into the total space of…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…