English
Related papers

Related papers: Generic symmetry-forced infinitesimal rigidity: tr…

200 papers

We analyze all possible symmetry reductions of Lagrangians that yield fully equivalent field equations for any 4-dimensional metric theory of gravity. Specifically, we present a complete list of infinitesimal group actions obeying the…

General Relativity and Quantum Cosmology · Physics 2025-04-10 Guillermo Frausto , Ivan Kolář , Tomáš Málek , Charles Torre

Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp. $c_j\subset gl(n,{\bf C})$) so that there exist irreducible $(p+1)$-tuples of…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Kostov

We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…

Combinatorics · Mathematics 2024-07-30 Martin Otto

The Hamiltonian formulation of the teleparallel equivalent of general relativity (TEGR) is developed from an ordinary second-order Lagrangian, which is written as a quadratic form of the coefficients of anholonomy of the orthonormal frames…

General Relativity and Quantum Cosmology · Physics 2016-11-30 Rafael Ferraro , María José Guzmán

In this paper we use the connections between tropical algebraic geometry and rigid analytic geometry in order to prove two main results. We use tropical methods to prove a theorem about the Newton polygon for convergent power series in…

Algebraic Geometry · Mathematics 2010-07-19 Joseph Rabinoff

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorphism $\theta: \mathbb{T}^n \to S^1$. A finite hyperplane arrangement is a finite collection of such hyperplanes. In this paper, we study the…

Combinatorics · Mathematics 2023-09-26 Diana Bergerová

A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…

Combinatorics · Mathematics 2012-11-12 Shin-ichi Tanigawa

We give a new proof, along with some generalizations, of a folklore theorem (attributed to Laurent Lafforgue) that a rigid matroid (i.e., a matroid with indecomposable basis polytope) has only finitely many projective equivalence classes of…

Combinatorics · Mathematics 2023-09-12 Matthew Baker , Oliver Lorscheid

Let k be a field, let G be an affine algebraic k-group and V a finite-dimensional G-module. We say V is rigid if the socle series and radical series coincide for the action of G on each indecomposable summand of V; say V is geometrically…

Representation Theory · Mathematics 2025-01-20 Michael Bate , David I. Stewart

In this paper, we show that the generalized hypergeometric function mF_m-1 has a one parameter group of local symmetries, which is a conjugation of a flow of a rational Calogero-Mozer system. We use the symmetry to construct fermionic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Oleg Gleizer

We construct a complex of toric varieties we call the quasisymmetric Grassmannian inside the Grassmannian of $r$-planes in $\mathbb{C}^n$. Each irreducible component is a positroid variety and an $S_n$ translate of a toric Richardson…

Algebraic Geometry · Mathematics 2026-04-29 Nantel Bergeron , Lucas Gagnon , Hunter Spink , Vasu Tewari

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

Combinatorics · Mathematics 2013-03-04 Michael Cuntz , David Geis

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

Combinatorics · Mathematics 2013-03-27 Laura Anderson , Emanuele Delucchi

Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindstr\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…

Representation Theory · Mathematics 2024-10-29 Matthew Fayers , Lucia Morotti

A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…

Quantum Physics · Physics 2018-05-09 Alexander Wilce

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

Combinatorics · Mathematics 2021-02-04 Raymond Cheng , Eric Katz

Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several other closely related classes of…

Combinatorics · Mathematics 2021-01-13 Kevin Grace

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa