English
Related papers

Related papers: Evasive sets, twisted varieties, and container-cli…

200 papers

First, we study constructible subsets of $\A^n_k$ which contain a line in any direction. We classify the smallest such subsets in $\A^3$ of the type $R\cup\{g\neq 0\},$ where $g\in k[x_1,...,x_n]$ is irreducible of degree $d$, and $R\subset…

Algebraic Geometry · Mathematics 2014-10-17 Kaloyan Slavov

One of the emerging problems in algebraic geometry is to characterize the affine $n$-space $\mathbb{A}^n$ among smooth affine schemes up to $\mathbb{A}^1$-contractibility. Recent efforts show that this characterization holds in dimensions…

Algebraic Geometry · Mathematics 2026-03-05 Krishna Kumar Madhavan Vijayalakshmi

Given an affine variety $X$, a morphism $\phi:X\to X$, a point $\alpha\in X$, and a Zariski closed subset $V$ of $X$, we show that the forward $\phi$-orbit of $\alpha$ meets $V$ in at most finitely many infinite arithmetic progressions, and…

Dynamical Systems · Mathematics 2014-09-16 Clayton Petsche

Inspired by Fujita's algebro-geometric result that complex projective space has maximal degree among all K-semistable complex Fano varieties, we conjecture that the height of a K-semistable metrized arithmetic Fano variety X of relative…

Algebraic Geometry · Mathematics 2024-11-20 Rolf Andreasson , Robert J. Berman

Let $k$, $d$ be a positive integer, $G$ be a connected graph of order $n$, $T$ be a tree. The leaf distance of a tree is defined as the minimum distance between any two leaves. For $v\in V(T)$, the leaf degree of $v$ in $T$ is the number of…

Combinatorics · Mathematics 2025-01-15 Jifu Lin , Lihua You

In this paper, we give new criteria for affineness of a variety defined over $\Bbb{C}$. Our main result is that an irreducible algebraic variety $Y$ (may be singular) of dimension $d$ ($d\geq 1$) defined over $\Bbb{C}$ is an affine variety…

Algebraic Geometry · Mathematics 2007-12-07 Jing Zhang

Let $\mathcal{F}\subseteq \binom{[n]}{r}$ be an intersecting family of sets and let $\Delta(\mathcal{F})$ be the maximum degree in $\mathcal{F}$, i.e., the maximum number of edges of $\mathcal{F}$ containing a fixed vertex. The…

Combinatorics · Mathematics 2023-06-02 Van Magnan , Cory Palmer , Ryan Wood

We introduce a new link invariant called the algebraic genus, which gives an upper bound for the topological slice genus of links. In fact, the algebraic genus is an upper bound for another version of the slice genus proposed here: the…

Geometric Topology · Mathematics 2020-06-25 Peter Feller , Lukas Lewark

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Number Theory · Mathematics 2015-12-18 Joachim von zur Gathen , Guillermo Matera

Given subvarieties $X, Y$ of a complex algebraic variety $S$ of complementary dimension, must they intersect? When $S$ is projective space, this is a consequence of the classical B\'ezout theorem, and an analogue for simple abelian…

Algebraic Geometry · Mathematics 2026-04-03 Gregorio Baldi , David Urbanik

Metric dimension is a graph parameter motivated by problems in robot navigation, drug design, and image processing. In this paper, we answer several open extremal problems on metric dimension and pattern avoidance in graphs from (Geneson,…

Combinatorics · Mathematics 2020-09-01 Jesse Geneson , Suchir Kaustav , Antoine Labelle

We derive a sharp scaling law for deviations of edge-isoperimetric sets in the lattice $\mathbb Z^d$ from the limiting Wulff shape in arbitrary dimensions. As the number $n$ of elements diverges, we prove that the symmetric difference to…

Mathematical Physics · Physics 2020-12-02 Edoardo Mainini , Bernd Schmidt

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal

In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the transitive tournament of order $k$. This conjecture is still completely open, as the…

A conjecture of Erd\H{o}s states that for any infinite set $A \subseteq \mathbb R$, there exists $E \subseteq \mathbb R$ of positive Lebesgue measure that does not contain any nontrivial affine copy of $A$. The conjecture remains open for…

Classical Analysis and ODEs · Mathematics 2022-04-28 Angel Cruz , Chun-Kit Lai , Malabika Pramanik

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

Logic · Mathematics 2022-10-07 Masato Fujita , Tomohiro Kawakami , Wataru Komine

We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is completely lost and errors act only on symbol…

Information Theory · Computer Science 2026-03-20 Avraham Kreindel , Isaac Barouch Essayag , Aryeh Lev Zabokritskiy

Let $d\geq 2$ be a positive integer, $K$ an algebraically closed field of characteristic not dividing $d$, $n\geq d+1$ a positive integer that is prime to $d$, $f(x)\in K[x]$ a degree $n$ monic polynomial without multiple roots, $C_{f,d}:…

Algebraic Geometry · Mathematics 2025-05-14 Boris M. Bekker , Yuri G. Zarhin

Let $T$ be a distinguished subset of vertices in a graph $G$. A $T$-\emph{Steiner tree} is a subgraph of $G$ that is a tree and that spans $T$. Kriesell conjectured that $G$ contains $k$ pairwise edge-disjoint $T$-Steiner trees provided…

Combinatorics · Mathematics 2015-08-11 Matt DeVos , Jessica McDonald , Irene Pivotto

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

Combinatorics · Mathematics 2026-05-08 Ritesh Goenka , Kenneth Moore
‹ Prev 1 8 9 10 Next ›