Related papers: Computing greatest common divisor of several param…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We compute the Gauss-Manin differential equation for any period of a polynomial in \ $\C[x_{0},\dots, x_{n}]$ \ with \ $(n+2)$ \ monomials. We give two general factorizations theorem in the algebra \ $\C< z, (\frac{\partial}{\partial…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
In this paper, we give a practical method to compute the Jacobian matrices of generalized Chebyshev polynomials associated to arbitrary semisimple Lie algebras. The entries of each Jacobian matrix can be expressed as a linear combination of…
The relevance of measuring Generalized Parton Distributions (GPDs) for few nucleon systems is illustrated. An approach which permits to calculate the GPDs of hadrons made of composite constituents by proper convolutions is described. The…
Variables in many massive high-dimensional data sets are structured, arising for example from measurements on a regular grid as in imaging and time series or from spatial-temporal measurements as in climate studies. Classical multivariate…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
Improvements in technology lead to increasing availability of large data sets which makes the need for data reduction and informative subsamples ever more important. In this paper we construct $ D $-optimal subsampling designs for…
Generalized parton distributions (GPDs) serve as indispensable tools for the exploration of proton structure. In this study, we offer a deep learning-assisted framework for the extraction of GPDs from experimental data and the results of…
We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it…
This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be…
We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…
We address two interrelated problems concerning the permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[y_1,\cdots,y_k][x]$ over…
We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…
The article derives multivariate Generalized Gram-Charlier (GGC) series that expands an unknown joint probability density function (\textit{pdf}) of a random vector in terms of the differentiations of the joint \textit{pdf} of a reference…
This study introduces a general semiparametric clusterwise index distribution model to analyze how latent clusters affect the covariate-response relationships. By employing sufficient dimension reduction to account for the effects of…
A divisibility sequence is a sequence of integers $\{d_n\}$ such that $d_m$ divides $d_n$ if $m$ divides $n$. Results of Bugeaud, Corvaja, Zannier, among others, have shown that the gcd of two divisibility sequences corresponding to…
In the realm of statistical learning, the increasing volume of accessible data and increasing model complexity necessitate robust methodologies. This paper explores two branches of robust Bayesian methods in response to this trend. The…
We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…