English
Related papers

Related papers: Regular Cayley maps on dihedral groups with the sm…

200 papers

Herein we prove that if $M$ is a compact oriented Riemann surface of genus $g$, and $M^{[n]}$ is the classifying space of $n$ distinct, unordered points on $M$, then the kernel of the map $\pi_1(M^{[n]})\to H_1(M)$ is generated by…

Group Theory · Mathematics 2007-05-23 D. Jeremy Copeland

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

Combinatorics · Mathematics 2026-05-29 Demetres Christofides , Klas Markström , Christina Savvidou

Let $M$ be a connected, non-compact $m$-dimensional Riemannian manifold. In this paper we consider smooth maps $\phi: M \to \mathbb{R}^n$ with images inside a non-degenerate cone. Under quite general assumptions on $M$, we provide a lower…

Differential Geometry · Mathematics 2024-10-15 Luciano Mari , Marco Rigoli

In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we…

Geometric Topology · Mathematics 2026-04-21 David Dolžan , Bogdana Oliynyk

An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K $ of its vertices such that for every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and for every $% u,v\in K$…

The norm kernel of the generator-coordinate method is shown to be a symmetric kernel of an integral equation with eigenfunctions defined in the Fock--Bargmann space and forming a complete set of orthonormalized states (classified with the…

Nuclear Theory · Physics 2016-09-08 G. F. Filippov , Yu. A. Lashko , S. V. Korennov , K. Kato

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle…

Probability · Mathematics 2026-02-17 Cheng Mao , Yihong Wu , Jiaming Xu

We give non-symmetric versions of the Cauchy kernel and Littlewood's kernels, corresponding to the types $A_n$, $B_n$, $C_n$ and $D_n$, of the classical groups. We show that these new kernels are diagonal in the basis of two families of key…

Combinatorics · Mathematics 2007-05-23 Amy M. Fu , Alain Lascoux

In a recent article with Oleg Smirnov, we defined short Peirce (SP) graded Kantor pairs. For any such pair P, we defined a family, parameterized by the Weyl group of type BC_2, consisting of SP-graded Kantor pairs called Weyl images of P.…

Rings and Algebras · Mathematics 2017-03-14 Bruce Allison , John Faulkner

There is a forgetful map from the mapping class group of a punctured surface to that of the surface with one fewer puncture. We prove that finitely generated purely pseudo-Anosov subgroups of the kernel of this map are convex cocompact in…

Geometric Topology · Mathematics 2007-09-10 Richard P. Kent , Christopher J. Leininger , Saul Schleimer

Given an undirected graph $G=(V,E)$, vertices $s,t\in V$, and an integer $k$, Tracking Shortest Paths requires deciding whether there exists a set of $k$ vertices $T\subseteq V$ such that for any two distinct shortest paths between $s$ and…

Data Structures and Algorithms · Computer Science 2022-02-25 Václav Blažej , Pratibha Choudhary , Dušan Knop , Jan Matyáš Křišťan , Ondřej Suchý , Tomáš Valla

Let $H$ be a digraph possibly with loops, $D$ a digraph without loops, and $\rho : A(D) \rightarrow V(H)$ a coloring of $A(D)$ ($D$ is said to be an $H$-colored digraph). If $W=(x_{0}, \ldots , x_{n})$ is a walk in $D$, and $i \in \{ 0,…

Combinatorics · Mathematics 2021-08-04 Hortensia Galeana-Sánchez , Miguel Tecpa-Galván

A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of…

Combinatorics · Mathematics 2015-12-21 Katerina Böhmová , Cristina Dalfó , Clemens Huemer

We construct a large family of positive-definite kernels $K: \mathbb{D}^n\times \mathbb{D}^n \to \mbox{M} (r, \mathbb C)$, holomorphic in the first variable and anti-holomorphic in the second, that are quasi-invariant with respect to the…

Functional Analysis · Mathematics 2023-01-10 Prahllad Deb , Somnath Hazra

Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism…

Combinatorics · Mathematics 2025-12-08 Rhys J. Evans , Primož Potočnik

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

Group Theory · Mathematics 2025-07-30 Fedor Vylegzhanin

Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…

Logic in Computer Science · Computer Science 2025-07-09 Antoine Chambert-Loir , María Inés de Frutos-Fernández

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

Group Theory · Mathematics 2014-02-26 Nick Gill

Let k be an arbitrary field, A be a standard graded Artinian Gorenstein k-algebra of embedding dimension four and socle degree three, and pi from P to A be a surjective graded homomorphism from a polynomial ring with four variables over k…

Commutative Algebra · Mathematics 2024-02-22 Sabine El Khoury , Andrew R. Kustin

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$…

Combinatorics · Mathematics 2025-06-05 Nino Bašić , Ivan Damnjanović , Patrick W. Fowler