English
Related papers

Related papers: On inscribed trapezoids and affinely 3-regular map…

200 papers

The doubling construction is a fast and important way to generate new solutions to the Hurwitz problem on sums of squares identities from any known ones. In this short note, we generalize the doubling construction and obtain from any given…

Rings and Algebras · Mathematics 2017-08-17 Chi Zhang , Hua-Lin Huang

We prove that in the moduli space of genus-g metric graphs the locus of graphs with gonality at most d has the classical dimension min{3g-3,2g+2d-5}. This follows from a careful parameter count to establish the upper bound and a…

Combinatorics · Mathematics 2017-10-10 Filip Cools , Jan Draisma

Let $d$ be a positive square-free integer $\equiv 3 \pmod{4}$ such that there is no invariant of the ideal class group $\mathbb{Q}\lbrack \sqrt{-d}\rbrack$ which is divisible by $4$. We prove an asymptotic formula for the number of immersed…

Number Theory · Mathematics 2018-01-04 Junehyuk Jung

For positive integers $\ell$ and $k$, a $(1^\ell, 2^k)$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $\ell$ matchings and $k$ induced matchings. A graph is $d$-irregular if it has no adjacent vertices of degree $d$.…

Combinatorics · Mathematics 2026-03-17 Xujun Liu , Jiacheng Yang , Xin Zhang

It is shown that if $\gamma$ is a path of finite $p$ variation ($1\leq p< 2$) in a euclidean vector space and $f,g,h$ are Lipschitz functions on the trace of $\gamma$ then $s\mapsto F(s)=\int_\gamma f^sg dh$ defines an entire holomorphic…

Classical Analysis and ODEs · Mathematics 2016-01-14 Andrew Ursitti

Given a noncompact disconnected complete periodic curve $\Gamma$ with no self intersection in $\mathbb R^3$, it is proved that there exists a noncompact simply connected periodic minimal surface spanning $\Gamma$. As an application it is…

Differential Geometry · Mathematics 2021-08-24 Jaigyoung Choe

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

Combinatorics · Mathematics 2008-04-11 Stefko Miklavic

We prove several results about matroids and matroidal families associated with rigidity in dimension $2$. In particular, we establish new properties of the generic rigidity matroid family $\mathcal{R}$ and Kalai's hyperconnectivity matroid…

Combinatorics · Mathematics 2026-02-13 Mykhaylo Tyomkyn

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Combinatorics · Mathematics 2011-05-23 Jim Geelen , Peter Nelson

The goal of this short paper to advertise the method of gauge transformations (aka holographic reduction, reparametrization) that is well-known in statistical physics and computer science, but less known in combinatorics. As an application…

Combinatorics · Mathematics 2020-04-03 Márton Borbényi , Péter Csikvári

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa

A famous result by Erd\H{o}s and Szekeres (1935) asserts that, for all $k,d \in \mathbb{N}$, there is a smallest integer $n = g^{(d)}(k)$ such that every set of at least $n$ points in $\mathbb{R}^d$ in general position contains a $k$-gon,…

Computational Geometry · Computer Science 2022-02-23 Manfred Scheucher

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov

We use bifurcation theory to determine the existence of infinitely many new examples of triply periodic minimal surfaces in $\mathbb R^3$. These new examples form branches issuing from the H-family, the rPD-family, the tP-family, and the…

Differential Geometry · Mathematics 2014-11-25 Miyuki Koiso , Paolo Piccione , Toshihiro Shoda

We define and explicitly construct schemes evinced by generalized additive decompositions (GADs) of a given $d$-homogeneous polynomial $F$. We employ GADs to investigate the regularity of $0$-dimensional schemes apolar to $F$, focusing on…

Commutative Algebra · Mathematics 2024-07-08 Alessandra Bernardi , Alessandro Oneto , Daniele Taufer

In this paper, we give infinitely many examples of (non-isomorphic) connected $k$-regular graphs with smallest eigenvalue in half open interval $[-1-\sqrt2, -2)$ and also infinitely many examples of (non-isomorphic) connected $k$-regular…

Combinatorics · Mathematics 2011-05-30 Hyonju Yu

Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…

Combinatorics · Mathematics 2020-07-10 John C. Urschel , Ludmil T. Zikatanov

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Computational Geometry · Computer Science 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos