Related papers: A Poisson formula for the sparse resultant
Composite likelihood has shown promise in settings where the number of parameters $p$ is large due to its ability to break down complex models into simpler components, thus enabling inference even when the full likelihood is not tractable.…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
Motivated by various problems in physics and applied mathematics, we look for constraints and properties of real Fourier-positive functions, i.e. with positive Fourier transforms. Properties of the "Dirac comb" distribution and of its…
We consider scattering by an abstract compactly supported perturbation in R^n. To include the traditional cases of potential, obstacle and metric scattering without going into their particular nature we adopt the "black box" formalism…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
The main perpose of this paper is to sudy the roots of a familly of polynomials that arise from a linear recurrences associated to Pascal's triangle and their zero attractor, using an analytical methods based on conformal mappings.
In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse…
In this paper we consider Poisson loglinear models with linear constraints (LMLC) on the expected table counts. Multinomial and product multinomial loglinear models can be obtained by considering that some marginal totals (linear…
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder…
Sparse linear discriminant analysis via penalized optimal scoring is a successful tool for classification in high-dimensional settings. While the variable selection consistency of sparse optimal scoring has been established, the…
We use Poisson summation formula to calculate integrals of producs of sinc functions (cf. [4]) and related integrals as in [5] and [3]. We also generalize the one in [5] and introduce other remarkable integrals. Finally we give a sum…
Let $X \subset Y$ be closed (possibly singular) subschemes of a smooth projective toric variety $T$. We show how to compute the Segre class $s(X,Y)$ as a class in the Chow group of $T$. Building on this, we give effective methods to compute…
An algebra isomorphism between algebras of matrices and difference operators is used to investigate the discrete integrable hierarchy. We find local and non-local families of R-matrix solutions to the modified Yang-Baxter equation. The…
We give an explicit formula for the decomposition of the tensor product of any two indecomposable non-projective modules for the symmetric group algebra $F \mathfrak{S}_p$ modulo projective modules. In particular, we show that the tensor…
The decomposition of a matrix, as a product of factors with particular properties, is a much used tool in numerical analysis. Here we develop methods for decomposing a matrix $C$ into a product $X Y$, where the factors $X$ and $Y$ are…
We present an upper bound for the height of the mixed sparse resultant, defined as the logarithm of the maximum modulus of its coefficients. We obtain a similar estimate for its Mahler measure.
The purpose of this note is to give a simple description of a (complete) family of functions in involution on certain hermitian symmetric spaces. This family, obtained via bi-hamiltonian approach using the Bruhat Poisson structure, is…
A procedure to include the uncertainty on the background estimate for upper limit calculations using Poissonian sampling is presented for the case where a Gaussian assumption on the uncertainty can be made. Under that hypothesis an analytic…
In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…
In this paper we use a set of partial differential equations to prove an expansion theorem for multiple complex Hermite polynomials. This expansion theorem allows us to develop a systematic and completely new approach to the complex Hermite…