Results 61 to 70 of about 420,658 (213)
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
Journal of Combinatorial Theory, Series B, 1986 An example is given of a finite group A of order 144, with a generating set \(X=\{x,y\}\) such that \(x^ 3=y^ 2=1\) and such that the Cayley graph C(A,X) has genus 4 and characteristic -6 (both of which are small relative to the order of A), although there is no short relator of the form \((xy)^ r\) with ...
openaire +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
A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions [PDF]
, 2010 We show that the result of Watkins (1990) [19] on constructing vertex-transitive non-Cayley graphs from line graphs yields a simple method that produces infinite families of vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions.
Tomanová, Jana
core +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
Discrete Analysis, 2017 Quasirandom Cayley graphs, Discrete Analysis 2017:6, 14 pp. An extremely important phenomenon in extremal combinatorics is that of _quasirandomness_: for many combinatorial structures, it is possible to identify a list of deterministic properties, each ...
David Conlon, Yufei Zhao
doaj +1 more source
Vertex-transitive generalized Cayley graphs which are not Cayley graphs
European Journal of Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ademir Hujdurovic +2 more
openaire +1 more source
Consistent Quadratic Phase Formation in 3D Fast Spin Echo Using Frequency‐Modulated RF Pulses
Magnetic Resonance in Medicine, Volume 96, Issue 2, Page 666-681, August 2026.ABSTRACT Purpose Frequency‐modulated (FM) RF pulses achieve broadband excitation with low RF peak power, which is required in MRI with inhomogeneous magnetic fields. However, the quadratic phase generated with FM pulses makes it difficult to use them in fast spin echo (FSE), because even and odd refocused echoes have different spatial phase profiles ...
Naoharu Kobayashi, Michael Garwood
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1979 AbstractBy a result of L. Lovász, the determination of the spectrum of any graph with transitive automorphism group easily reduces to that of some Cayley graph.We derive an expression for the spectrum of the Cayley graph X(G,H) in terms of irreducible characters of the group G: λti,1+…+λti,ni=∑g1,…,gt∈HXiΠs=1tgs for any natural number t, where ξi is an
openaire +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