Related papers: Computing greatest common divisor of several param…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
In this paper we included some basic properties for weighted greatest common divisors, and discuss how to speed up computing the weighted greatest common divisor. By ordering the 'weights' we are able to significantly shorten the operations…
This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…
We give a brief overview on the theory and phenomenology of generalized parton distributions (GPDs), including the recently developed framework of single-diffractive hard exclusive process for matching GPDs to experimental observables. We…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
We propose an iterative algorithm for the numerical computation of sums of squares of polynomials approximating given data at prescribed interpolation points. The method is based on the definition of a convex functional $G$ arising from the…
The goal of this paper is to characterize function distributions that deep learning can or cannot learn in poly-time. A universality result is proved for SGD-based deep learning and a non-universality result is proved for GD-based deep…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…
We study the distribution of the generalized gcd and lcm functions on average. The generalized gcd function, denoted by $(m,n)_b$, is the largest $b$-th power divisor common to $m$ and $n$. Likewise, the generalized lcm function, denoted by…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…
The concepts of Generalized Parton Distributions (GPD) are reviewed in an introductory and phenomenological fashion. These distributions provide a rich and unifying picture of the nucleon structure. Their physical meaning is discussed. The…
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized…
We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…