English
Related papers

Related papers: Generating k-Facets by Induction on the Dimension

200 papers

Bipolar orientations of planar maps have recently attracted some interest in combinatorics, probability theory and theoretical physics. Plane bipolar orientations with $n$ edges are known to be counted by the $n$th Baxter number $b(n)$,…

Combinatorics · Mathematics 2021-02-26 Mireille Bousquet-Mélou , Éric Fusy , Kilian Raschel

We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

Analysis of PDEs · Mathematics 2024-05-07 Nicholas Edelen , Aaron Naber , Daniele Valtorta

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…

Computational Geometry · Computer Science 2023-06-22 Vahideh Keikha , Sepideh Aghamolaei , Ali Mohades , Mohammad Ghodsi

We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…

Combinatorics · Mathematics 2015-07-21 J. Bouttier , E. Guitter

For k >= 1, let Torelli_g^1(k) be the k-th term in the Johnson filtration of the mapping class group of a genus g surface with one boundary component. We prove that for all k, there exists some G_k >= 0 such that Torelli_g^1(k) is generated…

Geometric Topology · Mathematics 2015-08-12 Thomas Church , Andrew Putman

We investigate Dirichlet-type series generated by representation functions that count the number of ways an integer can be expressed as a sum of 'k' signed higher even powers. By combining generalized theta generating functions with a…

Number Theory · Mathematics 2025-12-23 Mahipal Gurram

In this paper, we study generalized versions of the k-center problem, which involves finding k circles of the smallest possible equal radius that cover a finite set of points in the plane. By utilizing the Minkowski gauge function, we…

Optimization and Control · Mathematics 2024-09-19 Vo Si Trong Long , Nguyen Mau Nam , Jacob Sharkansky , Nguyen Dong Yen

We study the elliptic curve E given by y^2=x(x+1)(x+t) over the rational function field k(t) and its extensions K_d=k(\mu_d,t^{1/d}). When k is finite of characteristic p and d=p^f+1, we write down explicit points on E and show by…

Number Theory · Mathematics 2013-09-23 Douglas Ulmer

We prove that the k-medial axis of an arbitrary closed set in Rn is n-k+1-rectifiable (and hence of dimension at most n-k+1). This result gives a first stratification for medial axis of any closed set, which has been widely studied and used…

Classical Analysis and ODEs · Mathematics 2024-04-23 Xiangyu Liang

Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k=1,...,n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain…

Metric Geometry · Mathematics 2007-05-23 Roderik C. Lindenbergh

We show that if $k$ is a countable field, then there exists a finitely generated, infinite-dimensional, primitive algebraic $k$-algebra $A$ whose Gelfand-Kirillov dimension is at most six. In addition to this we construct a two-generated…

Rings and Algebras · Mathematics 2010-11-19 Jason P. Bell , Lance W. Small , Agata Smoktunowicz

Gaussian random polytopes have received a lot of attention especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less studied case where the dimension goes to infinity and the…

Probability · Mathematics 2023-07-04 Brett Leroux , Luis Rademacher

We look at curvatures that are supported on k-dimensional parts of a simplicial complex G. These curvature all satisfy the Gauss-Bonnet theorem, provided that the k-dimensional simplices cover $G$. Each of these curvatures can be written as…

Combinatorics · Mathematics 2024-09-04 Oliver Knill

A continuous map from R^m to R^N or from C^m to C^N is called k-regular if the images of any $k$ points are linearly independent. Given integers m and k a problem going back to Chebyshev and Borsuk is to determine the minimal value of N for…

Differential Geometry · Mathematics 2016-11-08 Jarosław Buczyński , Tadeusz Januszkiewicz , Joachim Jelisiejew , Mateusz Michałek

We construct k-parameter families of rational surface automorphisms for any k. These are automorphisms of surfaces X, which are constructed from iterated blowups over the projective plane. In certain cases: we are able to determine the…

Complex Variables · Mathematics 2009-02-28 Eric Bedford , Kyounghee Kim

We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…

Combinatorics · Mathematics 2011-03-04 Christian Stump

It was shown in [11] that for every origin-symmetric star body $K \subseteq \mathbb R^n$ of volume $1$, every even continuous probability density $f$ on $K$ and $1 \leq k \leq n-1$, there exists a subspace $F \subseteq \mathbb R^n$ of…

Metric Geometry · Mathematics 2024-11-07 J. Haddad

We study the extremal function $S^k_d(n)$, defined as the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For any fixed $d\geq2k\geq6$, we determine the asymptotic behavior of $S^k_d(n)$ up to a…

Combinatorics · Mathematics 2025-07-29 Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

For a class $\mathcal{D}$ of drawings of loopless (multi-)graphs in the plane, a drawing $D \in \mathcal{D}$ is \emph{saturated} when the addition of any edge to $D$ results in $D' \notin \mathcal{D}$ - this is analogous to saturated graphs…

Computational Geometry · Computer Science 2021-08-30 Steven Chaplick , Fabian Klute , Irene Parada , Jonathan Rollin , Torsten Ueckerdt