Related papers: Polynomial Eulerian shape distributions
We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…
SHAP (SHapley Additive exPlanations) has become a popular method to attribute the prediction of a machine learning model on an input to its features. One main challenge of SHAP is the computation time. An exact computation of Shapley values…
We introduce polystar bodies: compact starshaped sets whose gauge or radial functions are expressible by polynomials, enabling tractable computations, such as that of intersection bodies. We prove that polystar bodies are uniformly dense in…
In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…
We determine the expected curvature polynomial of random real projective varieties given as the zero set of independent random polynomials with Gaussian distribution, whose distribution is invariant under the action of the orthogonal group.…
The paper describes relations between Liouville type theorems for solutions of a periodic elliptic equation (or a system) on an abelian cover of a compact Riemannian manifold and the structure of the dispersion relation for this equation at…
For certain tame abelian covers of arithmetic surfaces X/Y we obtain striking formulas, involving a quadratic form derived from intersection numbers, for the equivariant Euler characteristics of both the canonical sheaf !X/Y and also its…
The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…
Composition of low-dimensional distributions, whose foundations were laid in the papaer published in the Proceeding of UAI'97 (Jirousek 1997), appeared to be an alternative apparatus to describe multidimensional probabilistic models. In…
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
We use methods from exterior differential systems (EDS) to develop a geometric theory of scalar, first-order Lagrangian functionals and their associated Euler-Lagrange PDEs, subject to contact transformations. The first chapter contains an…
This paper is concerned with the problem of sampling and interpolation involving derivatives in shift-invariant spaces and the error analysis of the derivative sampling expansions for fundamentally large classes of functions. A new type of…
The non isotropic noncentral elliptical shape distributions via pseudo-Wishart distribution are founded. This way, the classical shape theory is extended to non isotropic case and the normality assumption is replaced by assuming a…
The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…