Related papers: Uniform $l^2$-decoupling in $\mathbb R^2$ for Poly…

We study a family of dissections of flow polytopes arising from the subdivision algebra. To each dissection of a flow polytope, we associate a polynomial, called the left-degree polynomial, which we show is invariant of the dissection…

We compute bifunctors cohomology for matrix polynomials under conjugation and detect candidates for universal classes in higher invariant theory.

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…

We establish a Skoda-type $L^2$ division theorem for $L^2$-optimal pairs, using a technique that combines a new Bochner-type inequality derived from the $L^2$-optimal conditions and Skoda's basic inequality. As applications, we provide some…

We characterize matrix polynomials $P,Q$ such that the inequality $$ \left\Vert Q(D)u\right\Vert _{L^{2}}\leq C\left\Vert P(D)u\right\Vert _{L^{2}}\quad\text{for all }u\in C_c^\infty(\Omega), $$ holds on bounded open sets $\Omega$. We also…

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

We study global convex solutions of the Monge-Amp\`ere equation \[ \det D^2 u = \mu \quad \text{in } \mathbb{R}^n, \] where $\mu \not\equiv 0$ is a nonnegative locally finite periodic Borel measure on $\mathbb{R}^n$. We prove a…

In the paper, we investigate the uniqueness problem of entire functions concerning their linear differential polynomial in shift and obtain three results which improve and generalize the recent result due to Qi (Ann. Polon. Math., 102…

We introduce a class of convex equivolume partitions. Expected $L_2-$discrepancy are discussed under these partitions. There are two main results. First, under this kind of partitions, we generate random point sets with smaller expected…

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…

We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…

In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

We consider the problem of learning unions of rectangles over the domain $[b]^n$, in the uniform distribution membership query learning setting, where both b and n are "large". We obtain poly$(n, \log b)$-time algorithms for the following…

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of…

Both complete decoupling and tangent decoupling are classical tools aiming to compare two random processes where one has a weaker dependence structure. We give a new proof for the complete decoupling inequality, which provides a lower bound…