English
Related papers

Related papers: The merging operation and $(d-i)$-simplicial $i$-s…

200 papers

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Combinatorics · Mathematics 2023-11-10 Leah Leiner , Steven Simon

We review properties of q-orthogonal polynomials, related to their orthogonality, duality and connection with the theory of symmetric (self-adjoint) operators, represented by a Jacobi matrix. In particular, we show how one can naturally…

Classical Analysis and ODEs · Mathematics 2007-05-23 N. M. Atakishiyev , A. U. Klimyk

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…

Combinatorics · Mathematics 2025-05-12 Thomas Wannerer

We classify terminal simplicial reflexive d-polytopes with 3d-1 vertices. They turn out to be smooth Fano d-polytopes. When d is even there is 1 such polytope up to isomorphism, while there are 2 when d is uneven.

Combinatorics · Mathematics 2007-05-23 Mikkel Øbro

We show that there exist k-neighborly centrally symmetric d-dimensional polytopes with 2(n+d) vertices, where k(d,n)=Theta(d/(1+log ((d+n)/d))). We also show that this bound is tight.

Combinatorics · Mathematics 2007-05-23 Nathan Linial , Isabella Novik

A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…

Combinatorics · Mathematics 2018-06-18 Samuel Fiorini , Marco Macchia , Kanstantsin Pashkovich

We consider a family of pairs of m-by-p and m-by-q matrices, in which some entries are required to be zero and the others are arbitrary, with respect to transformations (A,B)--> (SAR,SBL) with nonsingular S, R, L. We prove that almost all…

Representation Theory · Mathematics 2007-10-08 Tatyana N. Gaiduk , Vladimir V. Sergeichuk

Let $F$ be a homogeneous polynomial of degree $d$ in $m+1$ variables defined over an algebraically closed field of characteristic 0 and suppose that $F$ belongs to the $s$-th secant variety of the $d$-uple Veronese embedding of…

Algebraic Geometry · Mathematics 2013-05-07 E. Ballico , A. Bernardi

We introduce two operations named biflip and puzzle-move on simple polytopes producing polytopes with diffeomorphic moment-angle manifolds.

Geometric Topology · Mathematics 2017-08-02 Bosio Frédéric

This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…

Combinatorics · Mathematics 2012-09-17 Marie Albenque , Eric Fusy , Dominique Poulalhon

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

Metric Geometry · Mathematics 2009-09-29 Julian Pfeifle

This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…

Commutative Algebra · Mathematics 2021-04-16 Shashikant Mulay

We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…

Computational Geometry · Computer Science 2012-11-27 Menelaos I. Karavelas , Christos Konaxis , Eleni Tzanaki

We introduce two q-analogues of the 2D-Hermite polynomials which are functions of two complex variables. We derive explicit formulas, orthogonality relations, raising and lowering operator relations, generating functions, and Rodrigues…

Classical Analysis and ODEs · Mathematics 2015-08-21 Mourad E. H. Ismail , Ruiming Zhang

Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$…

Rings and Algebras · Mathematics 2017-07-06 Clément de Seguins Pazzis

These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…

History and Overview · Mathematics 2010-08-03 Chris Preston

For a positive integer $d\geq 2$, a family $\mathcal F\subseteq \binom{[n]}{k}$ is said to be d-wise intersecting if $|F_1\cap F_2\cap \dots\cap F_d|\geq 1$ for all $F_1, F_2, \dots ,F_d\in \mathcal F$. A d-wise intersecting family…

Combinatorics · Mathematics 2023-06-08 Menglong Zhang , Tao Feng

We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…

Quantum Physics · Physics 2014-07-22 Kil-Chan Ha , Seung-Hyeok Kye
‹ Prev 1 8 9 10 Next ›