English
Related papers

Related papers: Regular Polygonal Complexes of Higher Ranks in E^3

200 papers

In this note, we generalize the technique developed in [13] and prove that every 5xn matrix of tropical rank at most 3 has Kapranov rank at most 3, for the ground field that contains at least 4 elements. For the ground field either F_2 or…

Combinatorics · Mathematics 2012-07-20 Yaroslav Shitov

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…

Metric Geometry · Mathematics 2010-11-23 Simon Gravel , Veit Elser , Yoav Kallus

We present a simple and unified classification of macroscopic electromagnetic resonances in finite arbitrarily inhomogeneous isotropic dielectric 3D structures situated in free space. By observing the complex-plane dynamics of the spatial…

Classical Physics · Physics 2007-05-23 Neil V. Budko , Alexander B. Samokhin

There are 6 families of finite polar spaces of rank $3$. The set of lines in a rank $3$ polar space form a rank $5$ association scheme. We determine the regular sets of minimal size in several of these polar spaces, and describe some…

Combinatorics · Mathematics 2024-06-17 Ferdinand Ihringer , Morgan Rodgers

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

Statistics Theory · Mathematics 2019-09-24 Daniel Irving Bernstein , Grigoriy Blekherman , Rainer Sinn

We classify the normal CR structures on $S^3$ and their automorphism groups. Together with [3], this closes the classification of normal CR structures on contact 3-manifolds. We give a criterion to compare 2 normal CR structures, and we…

Differential Geometry · Mathematics 2007-05-23 Florin Alexandru Belgun

We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…

Combinatorics · Mathematics 2012-06-22 Anders Lundman

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…

In [Problems on polytopes, their groups, and realizations, Periodica Math. Hungarica 53 (2006) 231-255] Schulte and Weiss proposed the following problem: {\em Characterize regular polytopes of orders $2^np$ for $n$ a positive integer and…

Combinatorics · Mathematics 2024-07-16 Dong-Dong Hou , Yan-Quan Feng , Dimitri Leemans

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…

Computational Complexity · Computer Science 2018-01-04 Grey Ballard , Christian Ikenmeyer , J. M. Landsberg , Nick Ryder

This article deals with 3-forms on 6-dimensional manifodls, the first dimension where the classification of 3-forms is not trivial. There are three classes of multisymplectic 3-forms there. We study the class which is closely related to…

Differential Geometry · Mathematics 2007-05-23 Martin Panak , Jiri Vanzura

We classify the four dimensional perfect non-simple evolution algebras over a field having characteristic different from 2 and in which there are roots of orders 2, 3 and 7.

Rings and Algebras · Mathematics 2018-01-12 Yolanda Cabrera Casado , Muge Kanuni , Mercedes Siles Molina

We determine the combinatorial types of all the 3-dimensional simple convex polytopes in R^3 that can be realized as mean curvature convex (or totally geodesic) Riemannian polyhedra with non-obtuse dihedral angles in Riemannian 3-manifolds…

Differential Geometry · Mathematics 2024-07-30 Li Yu

We construct triangular hyperbolic polyhedra whose links are generalized 4-gons. The universal cover of those polyhedra are hyperbolic buildings, which appartments are hyperbolic planes tesselated by regular triangles with angles $\pi/4$.…

Combinatorics · Mathematics 2007-05-23 Riikka Kangaslampi , Alina Vdovina

It is conjectured since long that each smooth convex body $\mathbf{P}\subset \mathbb{R}^n$ has a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $\mathbf{P}$. The conjecture is proven…

Metric Geometry · Mathematics 2025-09-11 Ivan Nasonov , Gaiane Panina

We prove two rigidity results for complete Riemannian three-manifolds of higher rank. Complete three-manifolds have higher spherical rank if an only if they are spherical space forms. Complete finite volume three-manifolds have higher…

Differential Geometry · Mathematics 2016-08-18 Samuel Lin

Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is…

Representation Theory · Mathematics 2011-07-20 Maryna Nesterenko , Jiri Patera , Marzena Szajewska , Agnieszka Tereszkiewicz

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…

Algebraic Geometry · Mathematics 2022-10-28 Alexander M Kasprzyk , Benjamin Nill

A complete local ring of embedding codepth 3 has a minimal free resolution of length 3 over a regular local ring. Such resolutions carry a differential graded algebra structure, based on which one can classify local rings of embedding…

Commutative Algebra · Mathematics 2012-11-15 Lars Winther Christensen , Oana Veliche

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

Computational Complexity · Computer Science 2013-04-30 Jiri Matousek
‹ Prev 1 8 9 10 Next ›