English
Related papers

Related papers: The $\mathrm{L}_3(4)$ near octagon

200 papers

The local structure of 4-dimensional, conformally flat, almost $\epsilon$-K\"ahlerian (i.e., almost pseudo-K\"ahlerian and almost para-K\"ahlerian) manifolds is characterized with the help of left-regular and right-regular paraquaternionic…

Differential Geometry · Mathematics 2012-09-13 Karina Olszak , Zbigniew Olszak

Let G be a connected complex simple Lie group with maximal compact subgroup U. Let g be the Lie algebra of G, and X = G/U be the associated Riemannian globally symmetric space of type IV. We have constructed three types of arithmetic…

Representation Theory · Mathematics 2019-12-23 Pampa Paul

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…

Group Theory · Mathematics 2025-10-30 William H. Allen

We use the subgraph replacement method to prove a simple product formula for the tilings of an 8-vertex counterpart of Propp's quasi-hexagons (Problem 16 in New Perspectives in Geometric Combinatorics, Cambridge University Press, 1999),…

Combinatorics · Mathematics 2014-09-09 Tri Lai

Hitchin shows that half-flat SU(3)-structures on a 6-dimensional manifold M can be lifted to parallel G_{2}-structure on the product $M\times\mathbb{R}$. We show that Hitchin's approach can also be used to construct nearly parallel…

Differential Geometry · Mathematics 2007-07-16 Sebastian Stock

Let X be a complex algebraic K3 surface or a supersingular K3 surface in odd characteristic. We present an algorithm by which, under certain assumptions on X, we can calculate a finite set of generators of the image of the natural…

Algebraic Geometry · Mathematics 2015-02-10 Ichiro Shimada

Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to…

Data Structures and Algorithms · Computer Science 2025-10-21 Chuhan Qi

Let $(X,J,\omega,g)$ be a complete $n$-dimensional K\"ahler manifold. A Theorem by Gromov \cite{G} states that the if the K\"ahler form is $d$-bounded, then the space of harmonic $L_2$ forms of degree $k$ is trivial, unless $k=\frac{n}{2}$.…

Differential Geometry · Mathematics 2017-08-22 Richard Hind , Adriano Tomassini

Let N_0 = C^2/H be an isolated quotient singularity with H in U (2) a finite subgroup. We show that for any Q-Gorenstein smoothings of N_0 a nearby fiber admits ALE Ricci-flat Kahler metrics in any Kahler class. Moreover, we generalize…

Differential Geometry · Mathematics 2011-02-15 Ioana Suvaina

We realize the simple Lie superalgebra G(3) as supersymmetry of various geometric structures, most importantly super-versions of the Hilbert-Cartan equation (SHC) and Cartan's involutive PDE system that exhibit G(2) symmetry. We provide the…

Differential Geometry · Mathematics 2021-06-14 Boris Kruglikov , Andrea Santi , Dennis The

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

Group Theory · Mathematics 2021-05-07 R. A. Bailey , Peter J. Cameron , Cheryl E. Praeger , Csaba Schneider

A near-symplectic structure on a 4-manifold is a closed 2-form that is symplectic away from the 1-dimensional submanifold along which it vanishes and that satisfies a certain transversality condition along this vanishing locus. We…

Symplectic Geometry · Mathematics 2007-05-23 David T. Gay , Margaret Symington

Almost paracontact almost paracomplex Riemannian manifolds of the lowest dimension 3 are considered. Such structures are constructed on a family of Lie groups and the obtained manifolds are studied. Curvature properties of these manifolds…

Differential Geometry · Mathematics 2021-05-21 Mancho Manev , Veselina Tavkova

We study the fixed point subalgebra of a certain class of lattice vertex operator algebras by an automorphism of order 3, which is a lift of a fixed-point-free isometry of the underlying lattice. We classify the irreducible modules for the…

Quantum Algebra · Mathematics 2016-08-30 Kenichiro Tanabe , Hiromichi Yamada

Any simple pseudofinite group G is known to be isomorphic to a (twisted) Chevalley group over a pseudofinite field. This celebrated result mostly follows from the work of Wilson in 1995 and heavily relies on the classification of finite…

Group Theory · Mathematics 2024-12-16 Ulla Karhumäki , Frank Olaf Wagner

We revisit the classical Unit Distance Problem posed by Erd\H{o}s in 1946. While the upper bound of $O(n^{4/3})$ established by Spencer, Szemer'edi, and Trotter (1984) is tight for systems of pseudo-circles, it fails to account for the…

Combinatorics · Mathematics 2026-01-28 Lucas Aloisio

In this article we prove that the union of two almost orthogonal planes in R4 is Almgren-minimal. This gives an example of a one parameter family of minimal cones, which is a phenomenon that does not exist in R3. This work is motivated by…

Classical Analysis and ODEs · Mathematics 2014-02-26 Xiangyu Liang

Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution…

Dynamical Systems · Mathematics 2019-10-17 Hui Rao , Shu-Qin Zhang

It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…

Group Theory · Mathematics 2023-07-11 Lev Glebsky , Alexander Lubotzky , Nicolas Monod , Bharatram Rangarajan

We present approximation algorithms with O(n^3) processing time for the minimum vertex and edge guard problems in simple polygons. It is improved from previous O(n^4) time algorithms of Ghosh. For simple polygon, there are O(n^3) visibility…

Computational Geometry · Computer Science 2015-03-17 Dae-Sung Jang , Sun-Il Kwon