English
Related papers

Related papers: Intersection multiplicity, Milnor number and Berns…

200 papers

We prove the structure theorem of the intersection complexes of toric varieties in the category of mixed Hodge modules. This theorem is due to Bernstein, Khovanskii and MacPherson for the underlying complexes with rational coefficients. As…

Algebraic Geometry · Mathematics 2020-06-24 Morihiko Saito

Let R be the local ring of a point on a variety X over an algebraically closed field k. We make a connection between the notion of mixed (Samuel) multiplicity of m-primary ideals in R and intersection theory of subspaces of rational…

Algebraic Geometry · Mathematics 2015-05-14 Kiumars Kaveh , A. G. Khovanskii

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Combinatorics · Mathematics 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

Let $k$ be an algebraically closed field of characteristic $p > 0$. We show that if $X\subseteq\mathbb{P}^n_k$ is an equidimensional subscheme with Hilbert--Kunz multiplicity less than $\lambda$ at all points $x\in X$, then for a general…

Algebraic Geometry · Mathematics 2020-03-24 Rankeya Datta , Austyn Simpson

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

Let S be a smooth projective surface, and consider the following two subvarieties of the Hilbert scheme parameterizing closed subschemes of S of length n: A = {subschemes with support in a fixed point of S} B = {subschemes with support in…

alg-geom · Mathematics 2008-02-03 Geir Ellingsrud , Stein Arild Strømme

In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\KG{r}{\pmb s}{\calS}$, "generalized $r$-uniform Kneser hypergraphs with intersection multiplicities $\pmb s$." It generalized previous…

Combinatorics · Mathematics 2012-04-23 Carsten Lange , Guenter M. Ziegler

A significant group of problems coming from the realm of Combinatorial Geometry can only be approached through the use of Algebraic Topology. From the first such application to Kneser's problem in 1978 by Lov% \'{a}sz \cite{Lovasz} through…

Algebraic Topology · Mathematics 2007-05-23 Pavle V. M. Blagojevic , Aleksandra S. Dimitrijevic Blagojevic

Let $k$ be a commutative ring and $S=k[x_0, \ldots, x_n]$ be a polynomial ring over $k$ with a monomial order. For any monomial ideal $J$, there exists an affine $k$-scheme of finite type, called Gr\"obner scheme, which parameterizes all…

Algebraic Geometry · Mathematics 2019-09-27 Yuta Kambe

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

Dynamical Systems · Mathematics 2020-10-13 José M. Amigó , Angel Giménez

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Combinatorics · Mathematics 2021-01-19 Karim Adiprasito , Raman Sanyal

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Number Theory · Mathematics 2019-09-12 László Mérai , Igor E. Shparlinski

The celebrated theorem of Ahlswede and Khachatrian determines the maximum size of a family of $k$-element subsets of an $n$-element set where the intersection of any two subsets has at least $r$ elements. This survey first gives a…

Combinatorics · Mathematics 2016-02-09 Gyula O. H. Katona

We describe a new relation between the topology of hypersurface complements, Milnor fibers and degree of gradient mappings. The main tools are polar curves and the affine Lefschetz theory developped by H. Hamm and A. N\'emethi. In the…

Algebraic Topology · Mathematics 2007-05-23 A. Dimca

We discuss coincidences of pairs (f_1, f_2) of maps between manifolds. We recall briefly the definition of four types of Nielsen numbers which arise naturally from the geometry of generic coincidences. They are lower bounds for the minimum…

Algebraic Topology · Mathematics 2013-05-09 Ulrich Koschorke

Let $ k, n \in \mathbb{N}^+ $ and $ m \in \mathbb{N}^+ \cup \{\infty \} $. A $ k $-multiset in $ [n]_m $ is a $ k $-set whose elements are integers from $ \{1, 2, \ldots, n\} $, and each element is allowed to have at most $ m $ repetitions.…

Combinatorics · Mathematics 2024-07-09 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu