English
Related papers

Related papers: Veldkamp quadrangles and polar spaces

200 papers

A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the…

Metric Geometry · Mathematics 2026-05-20 Bohdan Biekietov , Iwan Praton , Weiran Zeng

The line graph $\Gamma$ of a multi-graph $\Delta$ is the graph whose vertices are the edges of $\Delta$, where two such edges are adjacent if and only if they meet in a single vertex of $\Delta$. We provide several characterizations of such…

Combinatorics · Mathematics 2021-05-19 Hans Cuypers

The Veldkamp space, in the sense of Buekenhout and Cohen, of the generalized quadrangle GQ(4, 2) is shown not to be a (partial) linear space by simply giving several examples of Veldkamp lines (V-lines) having two or even three Veldkamp…

Mathematical Physics · Physics 2012-02-16 Metod Saniga

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

Combinatorics · Mathematics 2007-05-23 Jonathan Fine

Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…

Combinatorics · Mathematics 2019-02-05 Alathea Jensen

We classify the reflexive modules of rank one over rational and minimally elliptic singularities. Equivalently, we classify full line bundles on the resolutions of rational and minimally elliptic singularities. As an application, we…

Algebraic Geometry · Mathematics 2023-05-11 András Némethi , Agustín Romano-Velázquez

A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…

Combinatorics · Mathematics 2025-07-02 Raju Nandi

A singular Riemannian foliation $F$ on a complete Riemannian manifold $M$ is called a polar foliation if, for each regular point $p$, there is an immersed submanifold $\Sigma$, called section, that passes through $p$ and that meets all the…

Differential Geometry · Mathematics 2012-03-21 Marcos M. Alexandrino

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Group Theory · Mathematics 2020-06-23 Cristina Acciarri , Andrea Lucchini

Recently, a number of interesting relations have been discovered between generalised Pauli/Dirac groups and certain finite geometries. Here, we succeeded in finding a general unifying framework for all these relations. We introduce…

Mathematical Physics · Physics 2009-10-13 Hans Havlicek , Boris Odehnal , Metod Saniga

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

Combinatorics · Mathematics 2021-02-11 Vinod Kumar , Krishnendra Shekhawat

Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…

Combinatorics · Mathematics 2013-12-13 Susana-Clara López , Francesc-Antoni Muntaner-Batle

A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…

Combinatorics · Mathematics 2015-01-15 R. H. Eggermont , M. Hendriks

A compact graph-like space is a triple $(X,V,E)$ where $X$ is a compact, metrizable space, $V \subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X \setminus V \cong E \times (0,1)$. New characterizations of…

Combinatorics · Mathematics 2016-09-06 Benjamin Espinoza , Paul Gartside , Max Pitz

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

Group Theory · Mathematics 2016-07-26 Jan Fricke

We prove that for any element in the $\gamma$-completion of the space of smooth compact exact Lagrangian submanifolds of a cotangent bundle, if its $\gamma$-support is a smooth Lagrangian submanifold, then the element itself is a smooth…

Symplectic Geometry · Mathematics 2025-04-22 Tomohiro Asano , Stéphane Guillermou , Yuichi Ike , Claude Viterbo

A Lie algebra is said to be quadratic if it admits a symmetric invariant and non-degenerated bilinear form. Semisimple algebras with the Killing form are examples of these algebras, while orthogonal subspaces provide abelian quadatric…

Rings and Algebras · Mathematics 2023-09-01 Pilar Benito , Jorge Roldán-López

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…

Combinatorics · Mathematics 2015-05-15 Philippe Jaming , Mate Matolcsi

Let $\Pi$ be a polar space of type $\textsf{D}_{n}$. Denote by ${\mathcal G}_{\delta}(\Pi)$, $\delta\in \{+,-\}$ the associated half-spin Grassmannians and write $\Gamma_{\delta}(\Pi)$ for the corresponding half-spin Grassmann graphs. In…

Combinatorics · Mathematics 2014-01-14 Mark Pankov