English
Related papers

Related papers: Some six-dimensional rigid forms

200 papers

We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…

Metric Geometry · Mathematics 2007-05-23 Achill Schuermann , Frank Vallentin

Let $G$ be a simply connected, solvable Lie group and $\Gamma$ a lattice in $G$. The deformation space $\mathcal{D}(\Gamma,G)$ is the orbit space associated to the action of $\Aut(G)$ on the space $\mathcal{X}(\Gamma,G)$ of all lattice…

Differential Geometry · Mathematics 2014-02-26 Oliver Baues , Benjamin Klopsch

Lie algebra $\mathfrak{sl}(2)$ can be realised by vector fields on $\mathbb{R}^1\ni x$ with polynomial coefficients $1$, $-2x$, $-x^2$; their Wronskian determinants yield the Lie bracket. Likewise, the monomials $1$, $\ldots$, $x^k/k!$,…

Rings and Algebras · Mathematics 2026-05-27 Markuss G. Ķēniņš , Arthemy V. Kiselev

In this paper, we show how regular convex 4-polytopes - the analogues of the Platonic solids in four dimensions - can be constructed from three-dimensional considerations concerning the Platonic solids alone. Via the Cartan-Dieudonne…

Mathematical Physics · Physics 2014-02-19 Pierre-Philippe Dechant

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

In this paper we prove birational superrigidity of finite covers of degree $d$ of the $M$-dimensional projective space of index 1, where $d\geqslant 5$ and $M\geqslant 10$, with at most quadratic singularities of rank $\geqslant 7$,…

Algebraic Geometry · Mathematics 2019-01-07 Aleksandr V. Pukhlikov

In this paper, we study $6$-dimensional GKM manifolds with $4$ fixed points. We classify all possible GKM graphs, and for each type of graph we construct a manifold, proving the existence. We show that six types occur. (P1) complex…

Geometric Topology · Mathematics 2026-02-19 Donghoon Jang , Shintaro Kuroki , Mikiya Masuda , Takashi Sato

We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of…

Algebraic Geometry · Mathematics 2025-06-02 Fulvio Gesmundo , Chiara Meroni

We study superpositions and direct integrals of quadratic and Dirichlet forms. We show that each quasi-regular Dirichlet space over a probability space admits a unique representation as a direct integral of irreducible Dirichlet spaces,…

Functional Analysis · Mathematics 2021-10-19 Lorenzo Dello Schiavo

This paper classifies Hermitian structures on 6-dimensional nilmanifolds M=G/L for which the fundamental 2-form is d d-bar closed, a condition that is shown to depend only on the underlying complex structure J of M. The space of such J is…

Differential Geometry · Mathematics 2013-10-15 Anna Fino , Maurizio Parton , Simon Salamon

We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.

Combinatorics · Mathematics 2015-10-20 Roland Bacher

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

Metric Geometry · Mathematics 2018-03-22 Antoine Deza , Lionel Pournin

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

Combinatorics · Mathematics 2012-12-27 Raman Sanyal

We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem'…

Combinatorics · Mathematics 2022-08-05 Francisco Criado , Francisco Santos

We give a geometric description of supersymmetric gravity/(non-)abelian $p$-form hierarchies in superspaces with 4D, $N = 1$ super-Poincare invariance. These hierarchies give rise to Chern-Simons-like invariants, such as those of the 5D, $N…

High Energy Physics - Theory · Physics 2017-05-24 Katrin Becker , Melanie Becker , William D. Linch , Stephen Randall , Daniel Robbins

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…

Rings and Algebras · Mathematics 2013-10-01 George Grätzer

In every odd dimension $n\geq 5$ we exhibit large classes of closed $n$-dimensional manifolds which admit infinitely many different geometries of positive Ricci curvature, i.e., manifolds for which their moduli space of metrics of positive…

Differential Geometry · Mathematics 2025-11-17 Anand Dessai

The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…

Combinatorics · Mathematics 2016-07-26 João Gouveia , Kanstanstin Pashkovich , Richard Z. Robinson , Rekha R. Thomas

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…

Combinatorics · Mathematics 2023-10-13 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni