English
Related papers

Related papers: Parametrization by polytopes of intersections of o…

200 papers

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

Let $P_{\lambda\Sigma_n}$ be the Ehrhart polynomial associated to an intergal multiple $\lambda$ of the standard symplex $\Sigma_n \subset \mathbb{R}^n$. In this paper we prove that if $(M, L)$ is an $n$-dimensional polarized toric manifold…

Differential Geometry · Mathematics 2022-06-29 Andrea Loi , Fabio Zuddas

We give a necessary and sufficient condition in terms of pattern avoidance for the conjugates of the bottom vertex in the Bruhat graph attached to an O_n orbit O in the flag variety for GL_n to have degree equal to the rank of this graph as…

Combinatorics · Mathematics 2020-10-15 William M. McGovern

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Combinatorics · Mathematics 2011-03-18 Hoi H. Nguyen

A lamination $\lambda$ is $\epsilon$-thick (with respect to a basepoint $X$), if the Teichm\"uller ray from $X$ in the direction of $\lambda$ stays in the $\epsilon$-thick part. We show that, for surfaces of high enough genus, any two…

Geometric Topology · Mathematics 2024-10-31 Jon Chaika , Sebastian Hensel

Let $L$ be a field of positive characteristic $p$ with a fixed algebraic closure $\overline{L}$, and let $\alpha_1,\alpha_2,\beta\in L$. For an integer $d\ge 2$, we consider the family of polynomials $f_{\lambda}(z) := z^d+\lambda$,…

Number Theory · Mathematics 2026-04-02 Shamil Asgarli , Dragos Ghioca

The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…

Optimization and Control · Mathematics 2015-06-30 C. H. Jeffrey Pang

The convex hull $\psi_{n,n}$ of certain $(n!)^2$ tensors was considered recently in connection with graph isomorphism. We consider the convex hull $\psi_n$ of the $n!$ diagonals among these tensors. We show: 1. The polytope $\psi_n$ is a…

Computational Complexity · Computer Science 2009-08-22 Shmuel Onn

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

Combinatorics · Mathematics 2012-12-19 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

We provide a detailed description of the maps associated with spectral interlacing, for rank one perturbations and bordering of symmetric and Hermitian matrices. The arguments rely on standard techniques of nonlinear analysis.

Spectral Theory · Mathematics 2022-01-21 Ricardo S. Leite , Carlos Tomei

The quantum phase diagram for a finite $3$-level system in the $\Lambda$ configuration, interacting with a two-mode electromagnetic field in a cavity, is determined by means of information measures such as fidelity, fidelity susceptibility…

Quantum Physics · Physics 2023-02-21 O. Castaños , S. Cordero , R. López-Peña , E. Nahmad-Achar

Topological supermatter is given by ordinary topological matter constrained by supersymmetry or graded supergroups such as OSP(2N|2N). Using results on super oscillators and lattice QFT$_{d}$, we construct a super tight binding model on…

High Energy Physics - Theory · Physics 2023-03-23 L. B Drissi , E. H Saidi

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

Representation Theory · Mathematics 2007-05-23 Nimish A. Shah

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entries. We show that $G$ has determinant zero if and…

Combinatorics · Mathematics 2017-06-13 Supalak Sumalroj

We study the manifold $Q_{\Gamma, \lambda}$ of isospectral real skew-symmetric matrices with a prescribed sparsity pattern determined by a graph $\Gamma$. The compact torus $T^n$ acts naturally on $Q_{\Gamma,\lambda}$ by conjugation, and…

Algebraic Topology · Mathematics 2026-02-10 Evgeny Zhukov

Let K be a number field, let f: P_1 --> P_1 be a nonconstant rational map of degree greater than 1, let S be a finite set of places of K, and suppose that u, w in P_1(K) are not preperiodic under f. We prove that the set of (m,n) in N^2…

Number Theory · Mathematics 2012-03-09 Pietro Corvaja , Vijay Sookdeo , Thomas J. Tucker , Umberto Zannier

A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…

Dynamical Systems · Mathematics 2017-07-04 Wolf Jung

We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…

Combinatorics · Mathematics 2022-08-05 Guillermo Pineda-Villavicencio , Benjamin Schröter

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…

Computational Geometry · Computer Science 2010-08-26 Hee-Kap Ahn , Otfried Cheong , Jirí Matoušek , Antoine Vigneron
‹ Prev 1 4 5 6 7 8 10 Next ›