相关论文: Finiteness for degenerate polynomials

We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, the eigenvalues are realized as the roots of a family of…

Let $G$ be a connected semisimple simply connected Lie group with a compact Cartan subgroup and let $\Gamma$ be a uniform lattice in $G$. Let $\widehat{G}_d$ denote the set of equivalence classes of unitary discrete series representations…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

In this article we study certain notions of `tameness' for the persistence modules studied in topological data analysis. In particular, we show that after adding infinitary points the so called finitely determined modules become finitely…

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

Given a prime $p$ and an integer $d>1$, we give a numerical criterion to decide whether the $\ell$-adic sheaf associated to the one-parameter exponential sums $t\mapsto \sum_x\psi(x^d+tx)$ over ${\mathbb F}_p$ has finite monodromy or not,…

We prove that, for every invertible horizontal-like map (i.e., H{\'e}non-like map) in any dimension, the sequence of the dynamical degrees is increasing until that of maximal value, which is the main dynamical degree, and decreasing after…

We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…

We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…

Using the well-known equivalence between meet-completions of posets and standard closure operators we show a general method for constructing meet-completions for isotone poset expansions. With this method we find a meet-completion for…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Let $P^{k}(n,p) $ be the set of all real polynomial map germs $f = ( f_1 , ..., f_p ) : (\mathbb{R}^{n},0) \rightarrow (\mathbb{R}^{p},0)$ with degree of $f_1 , ...,f_p$ less than or equal to $ k \in \mathbb{N}$. The main result of this…

We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…