English
Related papers

Related papers: Largest zero-dimensional intersection of $r$ degre…

200 papers

Given a sequence $\{Z_d\}_{d\in \mathbb{N}}$ of smooth and compact hypersurfaces in $\mathbb{R}^{n-1}$, we prove that (up to extracting subsequences) there exists a regular definable hypersurface $\Gamma\subset \mathbb{R}\mathrm{P}^n$ such…

Algebraic Geometry · Mathematics 2019-12-02 Saugata Basu , Antonio Lerario , Abhiram Natarajan

Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…

Combinatorics · Mathematics 2017-02-07 Martina Juhnke-Kubitzke , Timo de Wolff

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel

We generalize some properties related to Hilbert series and Lefschetz properties of Milnor algebras of projective hypersurfaces with isolated singularities to the more general case of an almost complete intersection ideal $J$ of dimension…

Algebraic Geometry · Mathematics 2017-08-30 Alexandru Dimca , Dorin Popescu

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

Combinatorics · Mathematics 2019-01-17 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n} (i.e., the number of one-dimensional faces of P_{d,n}…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Anja Remshagen

Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 2007 considered algorithmic questions in intersection graphs of…

Computational Geometry · Computer Science 2019-11-05 Chandra Chekuri , Tanmay Inamdar

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of…

Combinatorics · Mathematics 2021-03-08 József Balogh , Nathan Lemons , Cory Palmer

Supersymmetric nonlinear sigma models have target spaces that carry interesting geometry. The geometry is richer the more supersymmetries the model has. The study of models with two dimensional world sheets is particularly rewarding since…

High Energy Physics - Theory · Physics 2022-03-08 Ulf Lindström

A closed subscheme of codimension two $T \subset P^2$ is a quasi complete intersection (q.c.i.) of type $(a,b,c)$ if there exists a surjective morphism $\mathcal{O} (-a) \oplus \mathcal{O} (-b) \oplus \mathcal{O} (-c) \to \mathcal{I} _T$.…

Algebraic Geometry · Mathematics 2019-01-04 Philippe Ellia

Given a $d$-dimensional convex polytope $P$ and nonnegative integer $k$ not exceeding $d-1$, let $G_k (P)$ denote the simple graph on the node set of $k$-dimensional faces of $P$ in which two such faces are adjacent if there exists a…

Combinatorics · Mathematics 2008-01-10 Christos A. Athanasiadis

We introduce an infinite variant of hypersurface support for finite-dimensional, noncommutative complete intersections. By a noncommutative complete intersection we mean an algebra R which admits a smooth deformation $Q\to R$ by a…

K-Theory and Homology · Mathematics 2021-01-01 Cris Negron , Julia Pevtsova

In this article we study the effect of a delta-interaction on a polymerized membrane of arbitrary internal dimension D. Depending on the dimensionality of membrane and embedding space, different physical scenarios are observed. We emphasize…

Condensed Matter · Physics 2009-11-07 Henryk A. Pinnow , Kay Joerg Wiese

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Combinatorics · Mathematics 2024-06-12 Hyunwoo Lee

In this paper we describe all possible reduced complete intersection sets of points on Veronese surfaces. We formulate a conjecture for the general case of complete intersection subvarieties of any dimension and we prove it in the case of…

Algebraic Geometry · Mathematics 2022-07-08 Stefano Canino , Enrico Carlini

In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…

Algebraic Geometry · Mathematics 2021-04-21 Roberto Laface , Piotr Pokora

This paper studies the Hausdorff dimension of the intersection of isotropic projections of subsets of $\mathbb{R}^{2n}$, as well as dimension of intersections of sets with isotropic planes. It is shown that if $A$ and $B$ are Borel subsets…

Metric Geometry · Mathematics 2020-01-17 Fernando Roman-Garcia

Following a combinatorial observation made by one of us recently in relation to a problem in quantum information [Nakata et al., Phys. Rev. X 7:021006 (2017)], we study what are the possible intersection cardinalities of a $k$-dimensional…

Combinatorics · Mathematics 2019-01-03 Nolmar Melo , Andreas Winter

We show that the size of the intersection of a Hermitian variety in $\PG(n,q^2)$, and any set satisfying an $r$-dimensional-subspace intersection property, is congruent to 1 modulo a power of $p$. In particular, in the case where $n=2$, if…

Combinatorics · Mathematics 2011-07-12 David B. Chandler

Two hypergraphs $H_1,\ H_2$ are called {\em cross-intersecting} if $e_1 \cap e_2 \neq \emptyset$ for every pair of edges $e_1 \in H_1,~e_2 \in H_2$. Each of the hypergraphs is then said to {\em block} the other. Given parameters $n,r,m$ we…

Combinatorics · Mathematics 2016-05-23 Ron Aharoni , David Howard