English
Related papers

Related papers: Stabbing boxes with finitely many axis-parallel li…

200 papers

We study the possible dimension vectors of indecomposable parabolic bundles on the projective line, and use our answer to solve the problem of characterizing those collections of conjugacy classes of n by n matrices for which one can find…

Algebraic Geometry · Mathematics 2007-05-23 William Crawley-Boevey

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

Rings and Algebras · Mathematics 2026-02-24 Vesselin Drensky

We prove that for any $K$ and $d$, there exist, for all sufficiently large admissible $v$, a pairwise balanced design PBD$(v,K)$ of dimension $d$ for which all $d$-point-generated flats are bounded by a constant independent of $v$. We also…

Combinatorics · Mathematics 2014-10-29 Nicholas M. A. Benson , Peter J. Dukes

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Miroslav Ploscica

In this paper, we give a numerical criterion of Reider-type for the $d$-very ampleness of the adjoint line bundles on quasi-elliptic surfaces, and meanwhile we give a new proof of the vanishing theorem on quasi-elliptic surfaces emailed…

Algebraic Geometry · Mathematics 2022-11-18 Yongming Zhang

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

Data Structures and Algorithms · Computer Science 2015-11-18 Isolde Adler , Stavros G. Kolliopoulos , Dimitrios M. Thilikos

Let $K_d$ denote the class of all finite graphs and, for graphs $A\subseteq B$, say $A \leq_d B$ if distances in $A$ are preserved in $B$; i.e. for $a, a' \in A$ the length of the shortest path in $A$ from $a$ to $a'$ is the same as the…

Logic · Mathematics 2016-01-14 Justin Brody

In this paper, we obtain infinitely many solutions for a class of quasilinear Schr\"{o}dinger-Poisson system which is coupled by a Schr\"{o}dinger equation of $p$-Laplacian and a Poisson equation of $q$-Laplacian, involving with concave and…

Analysis of PDEs · Mathematics 2025-09-22 Yao Du , Jiahao Peng

We modify an argument of Hablicsek and Scherr to show that if a collection of points in $\mathbb{C}^d$ spans many $r$--rich lines, then many of these lines must lie in a common $(d-1)$--flat. This is closely related to a previous result of…

Combinatorics · Mathematics 2018-07-10 Joshua Zahl

In this article, we introduce the notion of differential flatness by pure prolongation: loosely speaking, a system admits this property if, and only if, there exists a pure prolongation of finite order such that the prolonged system is…

Optimization and Control · Mathematics 2024-05-28 Jean Lévine

We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…

Algebraic Geometry · Mathematics 2022-05-31 Adrien Dubouloz

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite direction, we give a construction without an…

Combinatorics · Mathematics 2021-02-26 Boris Bukh , Ting-Wei Chao

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

Number Theory · Mathematics 2022-10-25 Wei Cao , Daqing Wan

The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for…

Combinatorics · Mathematics 2014-02-21 Henning Bruhn , Morgan Chopin , Felix Joos , Oliver Schaudt

We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…

Probability · Mathematics 2021-01-07 Zhongyang Li

Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of…

Computational Geometry · Computer Science 2011-04-08 G. Aloupis , J. Cardinal , S. Collette , S. Imahori , M. Korman , S. Langerman , O. Schwartz , S. Smorodinsky , P. Taslakian

An intriguing open problem in general relativity is whether a stationary equilibrium configuration of multiple, physically relevant black holes can exist. In such a hypothetical setup, the gravitational attraction would need to be balanced…

General Relativity and Quantum Cosmology · Physics 2026-04-15 Jörg Hennig

Let $X$ be a projective toric variety of dimension $n$ and let $L$ be a ample line bundle on $X$. For $k \geq 0$, it is in general difficult to determine whether $L^{\otimes k}$ is very ample and whether it additionally gives a projectively…

Algebraic Geometry · Mathematics 2026-02-25 Praise Adeyemo , Dominic Bunnett , Fabián Levicán-Santibáñez

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

Let K be a number field. A finite group G is called K-admissible if there exists a G-crossed product K-division algebra. K-admissibility has a necessary condition called K-preadmissibility that is known to be sufficient in many cases. It is…

Number Theory · Mathematics 2011-11-23 Danny Neftin