English
Related papers

Related papers: Polynomial Interpretation of Multipole Vectors

200 papers

Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…

Classical Analysis and ODEs · Mathematics 2007-06-13 Jonathan M. Borwein , David M. Bradley , David J. Broadhurst , Petr Lisonek

We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…

Combinatorics · Mathematics 2019-10-17 Niklas Kochdumper , Matthias Althoff

Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z)…

Complex Variables · Mathematics 2025-03-26 Dmitry Khavinson , Erik Lundberg , Sean Perry

We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…

Computational Complexity · Computer Science 2017-03-31 Jin-Yi Cai , Zhiguo Fu

Univariate polynomials with only real roots -- while special -- do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and…

Complex Variables · Mathematics 2009-11-19 David G. Wagner

Initiated by Mulmuley, Vazirani, and Vazirani (1987), many algebraic algorithms have been developed for matching and related problems. In this paper, we review basic facts and discuss possible improvements with the aid of fast computation…

Data Structures and Algorithms · Computer Science 2025-08-07 Ryotaro Sato , Yutaro Yamaguchi

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…

General Mathematics · Mathematics 2008-05-05 Jean Gallier

In 2022, Gezmis and Pellarin introduced and studied the concept of trivial multiple zeta values, along with a map from the vector space spanned by these values to the vector space spanned by Thakur's multiple zeta values. Their construction…

Number Theory · Mathematics 2023-06-23 Khac Nhuan Le , Kien Huu Nguyen

In this sequel to arxiv:arXiv:1012.0835 we develop Bezout type theorems for semidegrees (including an explicit formula for {\em iterated semidegrees}) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein…

Algebraic Geometry · Mathematics 2011-11-03 Pinaki Mondal

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

Numerical Analysis · Computer Science 2016-05-30 Alexander Kobel , Michael Sagraloff

In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…

Numerical Analysis · Mathematics 2024-01-05 Pelle Olsson

We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…

Algebraic Geometry · Mathematics 2025-07-18 Gregorio Baldi , David Urbanik

The manifold hypothesis suggests that word vectors live on a submanifold within their ambient vector space. We argue that we should, more accurately, expect them to live on a pinched manifold: a singular quotient of a manifold obtained by…

Computation and Language · Computer Science 2020-11-19 Alexander Jakubowski , Milica Gašić , Marcus Zibrowius

Fewnomial theory began with explicit bounds -- solely in terms of the number of variables and monomial terms -- on the number of real roots of systems of polynomial equations. Here we take the next logical step of investigating the…

Algebraic Geometry · Mathematics 2007-05-23 Frederic Bihan , J. Maurice Rojas , Casey E. Stella

The multiplicity Schwartz-Zippel lemma asserts that over a field, a low-degree polynomial cannot vanish with high multiplicity very often on a sufficiently large product set. Since its discovery in a work of Dvir, Kopparty, Saraf and Sudan…

Computational Complexity · Computer Science 2025-12-24 Siddharth Bhandari , Prahladh Harsha , Mrinal Kumar , Ashutosh Shankar

With a particular focus on explicit computations and applications of the Koszul homology and Betti numbers of monomial ideals, the main goals of this thesis are the following: Analyze the Koszul homology of monomial ideals and apply it to…

Commutative Algebra · Mathematics 2008-03-05 Eduardo Saenz-de-Cabezon

Single-input eigenvalue assignment problem (SEVAS) for dense (non-sparse) weakly controllable pairs A,B using Ackermann's formula is revisited. Factorizations are presented that are interpreted using quotient (factor) vector spaces.…

Optimization and Control · Mathematics 2023-11-13 Philippe Müllhaupt

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

We show how the threshold level of affine fusion, the fusion of Wess-Zumino-Witten (WZW) conformal field theories, fits into the Schubert calculus introduced by Gepner. The Pieri rule can be modified in a simple way to include the threshold…

High Energy Physics - Theory · Physics 2009-10-31 S. E. Irvine , M. A. Walton

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Information Theory · Computer Science 2020-11-23 Hugues Randriambololona