Related papers: Polynomial Interpretation of Multipole Vectors
Iterated commutators of multilinear Calderon-Zygmund operators and pointwise multiplication with functions in $BMO$ are studied in products of Lebesgue spaces. Both strong type and weak end-point estimates are obtained, including weighted…
Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…
In this work, some theorems are established for orthogonal trigonometric polynomials (OTP) including Favard, Baxter, Geronimus, Rakhmanov, Szeg\"o and the strong Szeg\"o theorems which are important in the theory of orthogonal polynomials…
Let $\mathcal{A}$ be a hyperplane arrangement in a complex projective space. It is an open question if the degree one cohomology jump loci (with complex coefficients) are determined by the combinatorics of $\mathcal{A}$. By the work of Falk…
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…
According to the G\"ottsche conjecture (now a theorem), the degree N^{d, delta} of the Severi variety of plane curves of degree d with delta nodes is given by a polynomial in d, provided d is large enough. These "node polynomials"…
Finding valid light paths that involve specular vertices in Monte Carlo rendering requires solving many non-linear, transcendental equations in high-dimensional space. Existing approaches heavily rely on Newton iterations in path space,…
Following ideas introduced by Beardon-Minda and by Baribeau-Rivard-Wegert in the context of the Schwarz-Pick lemma, we use the iterated hyperbolic difference quotients to prove a multipoint Julia lemma. As applications, we give a sharp…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…
We show that Mahler's classification of real numbers $\zeta$ with respect to the growth of the sequence $(w_{n}(\zeta))_{n\geq 1}$ is equivalently induced by certain natural assumptions on the decay of the sequence…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
We define convex-geometric counterparts of divided difference (or Demazure) operators from the Schubert calculus and representation theory. These operators are used to construct inductively polytopes that capture Demazure characters of…
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate interpolating subdivision schemes based on the solutions of…
We present a computational method for reconstructing a vector field on a convex polytope $\mathcal{P} \subset \mathbb{R}^d$ of arbitrary dimension from discrete samples. We specifically address the scenario where the vector field is subject…
In a recent paper the first two authors proved that the generating series of the Poincare polynomials of the quasihomogeneous Hilbert schemes of points in the plane has a simple decomposition in an infinite product. In this paper we give a…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
We introduce the concept of monodromy coordinates for representing solutions to large polynomial systems. Representing solutions this way provides a time-memory trade-off in a monodromy solving algorithm. We describe an algorithm, which…