English
Related papers

Related papers: Maximal fillings of moon polyominoes, simplicial c…

200 papers

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

Combinatorics · Mathematics 2023-08-11 Michaela Coleman , Anton Dochtermann , Nathan Geist , Suho Oh

We give finiteness results and some classifications up to diffeomorphism of minimal strong symplectic fillings of Seifert fibered spaces over S^2 satisfying certain conditions, with a fixed natural contact structure. In some cases we can…

Geometric Topology · Mathematics 2015-08-18 Laura Starkston

Let M be a hyperbolic n-manifold whose cusps have torus cross-sections. In arXiv:0901.0056, the authors constructed a variety of nonpositively and negatively curved spaces as "2\pi-fillings" of M by replacing the cusps of M with compact…

Geometric Topology · Mathematics 2016-01-20 Koji Fujiwara , Jason Fox Manning

Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…

Geometric Topology · Mathematics 2016-10-21 Tarik Aougab , Ian Biringer , Jonah Gaster

We study the foliation of a $D$-dimensional spherically symmetric black-hole spacetime with $D\ge 5$ by two kinds of one-parameter family of maximal hypersurfaces: a reflection-symmetric foliation with respect to the wormhole slot and a…

General Relativity and Quantum Cosmology · Physics 2010-03-25 Ken-ichi Nakao , Hiroyuki Abe , Hirotaka Yoshino , Masaru Shibata

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…

Algebraic Geometry · Mathematics 2018-12-12 Valentina Kiritchenko , Maria Padalko

The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s=p+iq where p and q are real polynomials of degree k and k-1 resp. with all real,…

Classical Analysis and ODEs · Mathematics 2025-07-01 V. Kostov , B. Shapiro , M. Tyaglov

A Bier sphere $Bier(K) = K\ast_\Delta K^\circ$, defined as the deleted join of a simplicial complex and its Alexander dual $K^\circ$, is a purely combinatorial object (abstract simplicial complex). Here we study a hidden geometry of Bier…

Combinatorics · Mathematics 2021-08-03 Filip D. Jevtić , Rade T. Živaljević

We study piecewise-linear and birational lifts of Sch\"utzenberger promotion, evacuation, and the RSK correspondence defined in terms of toggles. Using this perspective, we prove that certain chain statistics in rectangles shift predictably…

Combinatorics · Mathematics 2023-05-03 Joseph Johnson , Ricky Ini Liu

This paper contains examples of closed aspherical manifolds obtained as a by-product of recent work by the author [arXiv:math.GR/0509490] on the relative strict hyperbolization of polyhedra. The following is proved. (I) Any closed…

Group Theory · Mathematics 2009-04-23 Igor Belegradek

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

Classical Analysis and ODEs · Mathematics 2015-07-03 Catherine Bénéteau , Alberto Condori , Constanze Liaw , Daniel Seco , Alan Sola

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

Combinatorics · Mathematics 2014-10-30 Stephane Durocher , David S. Gunderson , Pak Ching Li , Matthew Skala

We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…

Combinatorics · Mathematics 2026-03-23 David Anderson , Greta Panova , Leonid Petrov

A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…

Numerical Analysis · Mathematics 2021-04-27 Aleš Vavpetič , Emil Žagar

The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in…

Combinatorics · Mathematics 2024-08-20 Thomas Bååth

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

Geometric Topology · Mathematics 2022-09-08 Jean Raimbault

Schubert polynomials represent a basis for the cohomology of the complete flag variety and thus play a central role in geometry and combinatorics. In this context, Schubert polynomials are generating functions over various combinatorial…

Combinatorics · Mathematics 2025-01-30 Sarah Gold , Elizabeth Milićević , Yuxuan Sun

In this paper, we study a variation of a conjecture of Debarre on positivity of cotangent bundles of complete intersections. We establish the ampleness of Schur powers of cotangent bundles of generic complete intersections in projective…

Algebraic Geometry · Mathematics 2021-01-11 Antoine Etesse

We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…

Combinatorics · Mathematics 2025-11-14 Olaf Parczyk , Silas Rathke , Tibor Szabó

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde