Related papers: Decoupling for mixed-homogeneous polynomials in $\…

In this short note, we prove that the restriction conjecture for the (hyperbolic) paraboloid in $\mathbb{R}^d$ implies the $l^p$-decoupling theorem for the (hyperbolic) paraboloid in $\mathbb{R}^{2d-1}$. In particular, this gives a simple…

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with…

In this paper we shall give formulas for the pairings of intersection cohomology classes of complementary dimensions in the intersection cohomology of geometric invariant theoretic quotients for which semistability is not necessarily the…

Let $Hilb^d(A^3)$ be the Hilbert scheme of $d$ points in $A^3$, and let $T_z$ denote the tangent space to a point $z \in Hilb^d(A^3)$. Okounkov and Pandharipande have conjectured that $\dim T_z$ and $d$ have the same parity for every $z$.…

In this work we prove that, for a general polyhedral domain of $\mathbb{R}^3$, the cohomology spaces of the discrete de Rham complex of [Di Pietro and Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes: Exactness,…

We prove an $l^p$ decoupling inequality for hypersurfaces with nonzero Gaussian curvature and use it to derive a corresponding $l^p$ decoupling for curves not contained in a hyperplane. This extends our earlier work from [2]

Combinatorial mixed valuations associated to translation-invariant valuations on polytopes are introduced. In contrast to the construction of mixed valuations via polarization, combinatorial mixed valuations reflect and often inherit…

We obtain simple proofs of certain inequalites for bivariate means.

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.

We make effective $l^2 L^p$ decoupling for the parabola in the range $4 < p < 6$. In an appendix joint with Jean Bourgain, we apply the main theorem to prove the conjectural bound for the sixth-order correlation of the integer solutions of…

This paper contains the proof of difference counterparts of the conjectures due to Keven Kadell on symmetric and anti-symmetric Macdonald polynomials.

In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…

In this note we present some results that were already conjectured in the work [9] by Bildhauer, Fuchs and Weickert, where they have investigated analytical aspects of coupled variational models with applications to mathematical imaging.…

We show that, for generic bihomogeneous polynomials, the determinant of the matrix of moving planes is irreducible.

In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.

We prove several results on homogeneous plurisubharmonic polynomials on $\mathbb{C}^n$, $n\in\mathbb{Z}_{\geq 2}$. Said results are relevant to the problem of constructing local bumpings at boundary points of pseudoconvex domains of finite…

We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…

Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hatami and Norine showed that it is undecidable to verify…