Results 61 to 70 of about 589,042 (217)
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Geometric inverse semigroup theory: a note on the Milnor–Schwarz lemma for inverse monoids
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract We generalise the Milnor–Schwarz lemma to inverse monoids acting on presheaves of geodesic metric spaces. We provide two proofs of this fact: one only uses elementary techniques, inspired by the arguments for group actions on metric spaces; the other involves a version of the Vietoris–Rips complex, and builds on work of Chung–Martínez–Szakács.
Giorgio Mangioni, Francesco Tesolin
wiley +1 more source
Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena +1 more
wiley +1 more source
Free semigroups of large critical exponent
Journal of Topology, Volume 19, Issue 3, September 2026.Abstract For a convergence group equipped with an expanding coarse‐cocycle, we construct finitely generated free subsemigroups, which we call Bishop−−Jonessemigroups$\textit{Bishop--Jones semigroups}$, of critical exponent arbitrarily close to but strictly less than the critical exponent of the ambient group.
Aleksander Skenderi
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
Title: Planar Cayley graph Author: Gloser David Department: Department of Algebra Supervisor: doc. Mgr. Pavel Růžička, Ph.D., Department of Algebra Abstract: In 1896, H.
Gloser, David
core +1 more source
The VC‐Dimension of Random Subsets of Finite Groups
Random Structures &Algorithms, Volume 69, Issue 1, August 2026.ABSTRACT For a random subset of a finite group G$$ G $$ of cardinality N$$ N $$, we consider the VC‐dimension of the family of its translates (equivalently the VC‐dimension of a random Cayley graph) and prove a law of large numbers as N→∞$$ N\to \infty $$. This answers a question of McDonald–Sahay–Wyman.
Brad Rodgers, Anurag Sahay
wiley +1 more source
Symmetry in complex networks [PDF]
, 2008 We consider the size and structure of the automorphism groups of a variety of empirical ‘real-world’ networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric.
Sanchez-Garcia, Ruben J. +2 more
core +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Representations of Borel Cayley Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1993 Summary: There is a continuing search for dense \((\delta, D)\) interconnection graphs, that is, regular, undirected, degree \(\delta\) graphs with diameter \(D\) and having a large number of nodes. Cayley graphs formed by Borel subgroups currently contribute to some of the densest known \((\delta =4,D)\) graphs for a range of \(D\). However, the group
K. Wendy Tang, Bruce W. Arden
openaire +2 more sources