Related papers: Explicit Volume-Preserving Splitting Methods for P…
Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…
Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
We consider the numerical simulation of Hamiltonian systems of ordinary differential equations. Two features of Hamiltonian systems are that energy is conserved along trajectories and phase space volume is preserved by the flow. We want to…
We give an explicit characterization of all minimal value set polynomials in $\F_q[x]$ whose set of values is a subfield $\F_{q'}$ of $\F_{q}$. We show that the set of such polynomials, together with the constants of $\F_{q'}$, is an…
The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
We present recent developments on the topic of the integrand reduction of scattering amplitudes. Integrand-level methods allow to express an amplitude as a linear combination of Master Integrals, by performing operations on the…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…
In this paper, an oscillation-free spectral volume (OFSV) method is proposed and studied for the hyperbolic conservation laws. The numerical scheme is designed by introducing a damping term in the standard spectral volume method for the…
Accurate volume estimation of objects from visual data is a long-standing challenge in computer vision with significant applications in robotics, logistics, and smart health. Existing methods often rely on complex 3D reconstruction…
In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V_n of vectors in R^n…
In this paper we consider the fundamental operations dilation and erosion of mathematical morphology. Many powerful image filtering operations are based on their combinations. We establish homomorphism between max-plus semi-ring of integers…
One fundamental goal of high-dimensional statistics is to detect or recover planted structure (such as a low-rank matrix) hidden in noisy data. A growing body of work studies low-degree polynomials as a restricted model of computation for…
This paper introduces a novel approach to compute the numerical fluxes at the cell boundaries for a cell-centered conservative numerical scheme. Explicit gradients used in deriving the reconstruction polynomials are replaced by high-order…
While state of the art image segmentation models typically output segmentations in raster format, applications in geographic information systems often require vector polygons. To help bridge the gap between deep network output and the…
Non divergence-free discretisations for the incompressible Stokes problem may suffer from a lack of pressure-robustness characterised by large discretisations errors due to irrotational forces in the momentum balance. This paper argues that…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
Recognizing elementary underlying concepts from observations (disentanglement) and generating novel combinations of these concepts (compositional generalization) are fundamental abilities for humans to support rapid knowledge learning and…