arXiv subjects

Klara Stokes

Publications and source records attributed to Klara Stokes.

At least 19 recordsLinked to original sources

arXiv2026

Rigidity on compact surfaces through hyperbolic symmetries

Generically the rigidity of bar-joint structures admits combinatorial characterisations in the Euclidean plane and, more generally, for frameworks on the sphere and the torus. The remaining case of compact surfaces of genus at least two has remained open. Using the hyperbolic geometry of their universal covers, we develop a theory of infinitesimal rigidity for frameworks on compact surfaces of genus at least two. By the uniformisation theorem, every such surface is a quotient of the hyperbolic plane by a surface group, allowing frameworks on the surface to be represented as infinite symmetric frameworks in the hyperbolic plane. Encoding the symmetry through gain graphs, we prove that infinitesimal rigidity is determined entirely by finite combinatorial data. Specifically, a framework is generically rigid if and only if its associated gain graph contains a spanning (2,3,1,0)-gain tight subgraph. This yields the first combinatorial characterisation of generic rigidity for frameworks on compact surfaces of genus at least two.

math.DG↗

arXiv2025

Groups represented by incidence geometries

The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and outer automorphisms of a group G simultaneously. More precisely, to any group G, we attempt to associate an incidence system whose group of type-preserving automorphisms is Inn(G), the group of inner automorphisms of G, and whose full group of automorphisms is the group Out(G) of outer automorphisms of G, getting what we call an incidence geometric representation theory for groups. Hence, in this setting, the group Inn(G) preserves the types of the associated incidence structure while the group Out(G) is acting non-trivially on the typeset of it, realizing the outer automorphisms of G as correlations. We give examples of incidence geometric representations for the dihedral groups, the symmetric groups, the automorphism groups of the five platonic solids, families of classical groups defined over fields such as the projective linear groups, and finally subgroups of free groups whose outer automorphism group is the largest finite subgroup of their automorphism group.

math.GR↗

arXiv2025

Counting for rigidity under projective transformations in the plane

Let $P$ be a set of points and $L$ a set of lines in the (extended) Euclidean plane, and $I \subseteq P\times L$, where $i =(p,l) \in I$ means that point $p$ and line $l$ are incident. The incidences can be interpreted as quadratic constraints on the homogeneous coordinates of the points and lines. We study the space of incidence preserving motions of the given incidence structure by linearizing the system of quadratic equations. The Jacobian of the quadratic system, our projective rigidity matrix, leads to the notion of independence/dependence of incidences. Column dependencies correspond to infinitesimal motions. Row dependencies or self-stresses allow for new interpretations of classical geometric incidence theorems. We show that self-stresses are characterized by a 3-fold balance. As expected, infinitesimal (first order) projective rigidity as well as second order projective rigidity imply projective rigidity but not conversely. Several open problems and possible generalizations are indicated.

math.CO↗

arXiv2024

Structural rigidity and flexibility using graphs of groups

In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will describe articulated motions of realisations of hypergraphs that uses the terminology of graph of groups, and describe the motions of such a framework using group theory. Our approach allows to model a variety of situations, such as parallel redrawings, scenes, polytopes, realisations of graphs on surfaces, and even unique colourability of graphs. This approach allows a concise description of various dualities in rigidity theory. We also provide a lower bound on the dimension of the infinitesimal motions of such a framework in the special case when the underlying group is a Lie group.

math.CO↗

arXiv2024

Projective rigidity of point-line configurations in the plane

In this paper, we establish a general setup for studying incidence-preserving motions of projective geometric configurations of points and lines via a "projective rigidity matrix". The spaces of infinitesimal motions of a point-line configuration and dependencies amongst the point-line incidences can be interpreted as the kernel and co-kernel of this projective rigidity matrix, respectively. We also introduce a symmetry-adapted projective rigidity matrix for analysing symmetric configurations and their symmetry-preserving motions. The symmetry may be a point group or a more general symmetry, such as an autopolarity.

math.MG↗

arXiv2024

A lattice framework for generalizing shellable complexes and matroids

We introduce the notion of power lattices that unifies and extends the equicardinal geometric lattices, Cartesian products of subspace lattices, and multiset subset lattices, among several others. The notions of shellability for simplicial complexes, q-complexes, and multicomplexes are then unified and extended to that of complexes in power lattices, which we name as P-complexes. A nontrivial class of shellable P-complexes are obtained via P-complexes of the independent sets of a matroid in power lattice, which we introduce to generalize matroids in Boolean lattices, q-matroids in subspace lattices, and sum-matroids in Cartesian products of subspace lattices. We also prove that shellable P-complexes in a power lattice yield shellable order complexes, extending the celebrated result of shellability of order complexes of (equicardinal) geometric lattices by Björner and also, a recent result on shellability of order complexes of lexicographically shellable q-complexes. Finally, we provide a construction of matroids on the lattice of multiset subsets from weighted graphs. We also consider a variation of Stanley-Reisner rings associated with shellable multicomplexes than the one considered by Herzog and Popescu and proved that these rings are sequentially Cohen-Macaulay.

math.CO↗

arXiv2023

Flag transitive geometries with trialities and no dualities coming from Suzuki groups

Recently, Leemans and Stokes constructed an infinite family of incidence geometries admitting trialities but no dualities from the groups PSL(2,q) (where $q=p^{3n}$ with $p$ a prime and $n>0$ a positive integer). Unfortunately these geometries are not flag transitive. In this paper, we construct the first infinite family of incidence geometries of rank three that are flag transitive and have trialities but no dualities. These geometries are constructed using chamber systems of Suzuki groups Sz(q) (where $q=2^{2e+1}$ with $e$ a positive integer and $2e+1$ is divisible by 3) and the trialities come from field automorphisms. We also construct an infinite family of regular hypermaps with automorphism group Sz(q) that admit trialities but no dualities.

math.GR↗

arXiv2023

Sparsity greedoids and pebble game algorithms for posets

We generalise a sparsity condition for hypergraphs and show a result relating sparseness of hypergraphs to the decomposition of a modified incidence graph into edge-disjoint forests. We also give new sparsity conditions for posets and define an algorithm of pebble game type for posets to test when these sparsity conditions hold. Furthermore, we prove that under natural conditions, the sparsity conditions define a greedoid.

math.CO↗

arXiv2023

On trialities and their absolute geometries

We introduce the notion of moving absolute geometry of a geometry with triality and show that, in the classical case where the triality is of type $(I_σ)$ and the absolute geometry is a generalized hexagon, the moving absolute geometry also gives interesting flag-transitive geometries with Buekenhout diagram with parameters $(d_p, g, d_L) = (5, 3, 6)$ for the groups $G_2(k)$ and $^3D_4(k)$, for any integer $k \geq 2$. We also classify the classical absolute geometries for geometries with trialities but no dualities coming from maps of Class III with automorphism group $L_2(q^3)$, where $q$ is a power of a prime. We then investigate the moving absolute geometries for these geometries, illustrating their interest in this case.

math.GR↗

arXiv2022

Incidence geometries with trialities coming from maps with Wilson trialities

Triality is a classical notion in geometry that arose in the context of the Lie groups of type $D_4$. Another notion of triality, Wilson triality, appears in the context of reflexible maps. We build a bridge between these two notions, showing how to construct an incidence geometry with a triality from a map that admits a Wilson triality. We also extend a result by Jones and Poulton, showing that for every prime power $q$, the group ${\rm L}_2(q^3)$ has maps that admit Wilson trialities but no dualities.

math.GR↗

arXiv2022

Exploring the infinitesimal rigidity of planar configurations of points and rods

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss the rigidity properties of geometric realizations of incidence geometries in relation to the rigidity of geometric realizations of other well-known structures, such as graphs and hypergraphs.The $2$-plane matroid is also discussed. Further, we extend a result of Whiteley to determine necessary conditions for an incidence geometry of points and lines with exactly three points on each line, or 3-uniform hypergraphs, to have a minimally rigid realization as points and lines in the plane. We also give examples to show that these conditions are not sufficient. Finally, we examine the rigidity properties of $v_k$-configurations. We provide several examples of rigid $v_3$-configurations, and families of flexible geometric $v_3$-configurations. The exposition of the material is supported by many figures.

math.CO↗

arXiv2022

When is a planar rod configuration infinitesimally rigid?

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric realization of the incidence geometry is infinitesimally rigid in regular position if and only if the resulting cone graph is infinitesimally rigid in generic position. This is a generalization of the Molecular conjecture.

math.CO↗

arXiv2020

Existence results for pentagonal geometries

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those without any opposite line pairs. A wide-ranging result about PENT(3,r) with any number of opposite line pairs is proved. We also determine the existence spectrum of PENT(4,r) systems with eleven possible exceptions.

math.CO↗

arXiv2016

Geometric decoding of subspace codes with explicit Schubert calculus applied to spread codes

This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the intersection of the Plücker embedding of the Grassmannian and an algebraic variety. We call such codes \emph{geometric subspace codes}. Complexity is substantially improved compared to the algorithm by Rosenthal, Silberstein and Trautmann and connections to finite geometry are given. The decoding algorithm is applied to Desarguesian spread codes, which are known to be defined as the intersection of the Plücker embedding of the Grassmannian with a linear space.

cs.IT↗

arXiv2015

Isometric point-circle configurations on surfaces from uniform maps

We embed neighborhood geometries of graphs on surfaces as point-circle configurations. We give examples coming from regular maps on surfaces with maximum number of automorphisms for their genus and survey geometric realization of pentagonal geometries coming from Moore graphs. An infinite family of point-circle $v_4$ configurations on $p$-gonal surfaces with two $p$-gonal morphisms is given. The image of these configuration on the sphere under the two $p$-gonal morphisms is also described.

math.AG↗

arXiv2015

Patterns of ideals of numerical semigroups

This article introduces patterns of ideals of numerical semigroups, thereby unifying previous definitions of patterns of numerical semigroups. Several results of general interest are proved. More precisely, this article presents results on the structure of the image of patterns of ideals, and also on the structure of the sets of patterns admitted by a given ideal.

math.RA↗

arXiv2015

Irreducibility of configurations

In a paper from 1886, Martinetti enumerated small $v_3$-configurations. One of his tools was a construction that permits to produce a $(v+1)_3$-configuration from a $v_3$-configuration. He called configurations that were not constructible in this way irreducible configurations. According to his definition, the irreducible configurations are Pappus' configuration and four infinite families of configurations. In 2005, Boben defined a simpler and more general definition of irreducibility, for which only two $v_3$-configurations, the Fano plane and Pappus' configuration, remained irreducible. The present article gives a generalization of Boben's reduction for both balanced and unbalanced $(v_r,b_k)$-configurations, and proves several general results on augmentability and reducibility. Motivation for this work is found, for example, in the counting and enumeration of configurations.

math.CO↗

arXiv2013

A formalization of re-identification in terms of compatible probabilities

Re-identification algorithms are used in data privacy to measure disclosure risk. They model the situation in which an adversary attacks a published database by means of linking the information of this adversary with the database. In this paper we formalize this type of algorithm in terms of true probabilities and compatible belief functions. The purpose of this work is to leave aside as re-identification algorithms those algorithms that do not satisfy a minimum requirement.

cs.CR↗