English
Related papers

Related papers: The geometry of quadrangular convex pyramids

200 papers

An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…

Combinatorics · Mathematics 2026-04-09 Edwin van Dam , Jack H. Koolen , Yanzhen Xiong

Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…

Computational Geometry · Computer Science 2017-05-16 Markus Chimani , Stefan Felsner , Stephen Kobourov , Torsten Ueckerdt , Pavel Valtr , Alexander Wolff

Let $\Sigma$ be a $C^3$ compact symmetric convex hypersurface in $\mathbf{R}^{8}$. For some special cases, we prove that when $\Sigma$ carries exactly four geometrically distinct closed characteristics, then all of them must be symmetric.

Symplectic Geometry · Mathematics 2013-09-24 Ping-An Zhang

By formulating N = 1, 2, 4, 8, D = 3, Yang-Mills with a single Lagrangian and single set of transformation rules, but with fields valued respectively in R,C,H,O, it was recently shown that tensoring left and right multiplets yields a…

High Energy Physics - Theory · Physics 2014-05-27 A. Anastasiou , L. Borsten , M. J. Duff , L. J. Hughes , S. Nagy

Let A be a commutative ring, B a commutative A-algebra and M a complex of B-modules. We begin by constructing the square Sq_{B/A} M, which is also a complex of B-modules. The squaring operation is a quadratic functor, and its construction…

Commutative Algebra · Mathematics 2007-05-23 Amnon Yekutieli , James J. Zhang

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano

A graph is $d$-rigid if for any generic realisation of the graph in $\mathbb{R}^d$ (equivalently, the $d$-dimensional sphere $\mathbb{S}^d$), there are only finitely many non-congruent realisations in the same space with the same edge…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger

For a strongly pseudo-convex complex Finsler manifold M, a bundle U of adapted unitary frames is canonically defined. A non-linear Hermitian connection on U, invariant under local biholomorphic isometries, is given and it proved to be…

Differential Geometry · Mathematics 2007-05-23 Andrea Spiro

For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…

Differential Geometry · Mathematics 2024-10-30 Herng Yi Cheng

We study the rigidity problems for open (complete and noncompact) $n$-manifolds with nonnegative Ricci curvature. We prove that if an asymptotic cone of $M$ properly contains a Euclidean $\mathbb{R}^{k-1}$, then the first Betti number of…

Differential Geometry · Mathematics 2025-07-03 Jiayin Pan , Zhu Ye

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

Metric Geometry · Mathematics 2016-10-11 Egon Schulte , Asia Ivić Weiss

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Combinatorics · Mathematics 2011-08-30 Suyoung Choi , Jang Soo Kim

Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular…

Computer Vision and Pattern Recognition · Computer Science 2007-05-23 Luc Brun , Walter G. Kropatsch

A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…

Computational Geometry · Computer Science 2026-04-08 Thomas Depian , Carolina Haase , Martin Nöllenburg , André Schulz

We show that for almost every $(P,\lambda)$ where $P$ is a convex polygon and $\lambda\in(0,1)$, the corresponding outer billiard about $P$ with contraction $\lambda$ is asymptotically periodic, i.e., has a finite number of periodic orbits…

Dynamical Systems · Mathematics 2017-07-06 José Pedro Gaivão

Let $f$ and $g$ be two circle endomorphisms of degree $d\geq 2$ such that each has bounded geometry, preserves the Lebesgue measure, and fixes $1$. Let $h$ fixing $1$ be the topological conjugacy from $f$ to $g$. That is, $h\circ f=g\circ…

Dynamical Systems · Mathematics 2022-06-29 John Adamski , Yunchun Hu , Yunping Jiang , Zhe Wang

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…

Computational Geometry · Computer Science 2015-03-18 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

Let $\Gamma$ be a graph product of finite groups, with finite underlying graph, and let $\Delta$ be the associated right-angled building. We prove that a uniform lattice $\Lambda$ in the cubical automorphism group Aut$(\Delta)$ is weakly…

Group Theory · Mathematics 2024-02-06 Sam Shepherd

Let P and Q be convex polyhedra in E3 with face lattices F(P) and F(Q) and symmetry groups G(P) and G(Q), respectively. Then, P and Q are called face equivalent if there is a lattice isomorphism between F(P) and F(Q); P and Q are called…

Metric Geometry · Mathematics 2015-09-01 M. Rostami , Henrique F. da Cruz , Ilda I. Rodrigues
‹ Prev 1 4 5 6 7 8 10 Next ›