Related papers: Generalized companion matrix for approximate GCD

Generalized matrix approximation plays a fundamental role in many machine learning problems, such as CUR decomposition, kernel approximation, and matrix low rank approximation. Especially with today's applications involved in larger and…

The cospark of a matrix is the cardinality of the sparsest vector in the column space of the matrix. Computing the cospark of a matrix is well known to be an NP hard problem. Given the sparsity pattern (i.e., the locations of the non-zero…

A simple non-Hermitean random matrix (RM) model is used to study the Glasgow method of finite-density lattice QCD. The zeros of the RM partition function are evaluated through an averaging procedure, involving the zeros of the RM…

We study the postcritically finite non-polynomial map $f(x)=\frac{1}{(x-1)^2}$ over a number field $k$ and prove various results about the geometric $G^{\text{geom}}(f)$ and arithmetic $G^{\text{arith}}(f)$ iterated monodromy groups of $f$.…

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

We propose a mathematical walk around the gcd of the values $A(n)$ and $B(n)$ of two polynomials evaluated at an integer $n$. This is an opportunity to use a very powerful tool: the resultant.

Generalized Fourier series with orthogonal polynomial bases have useful applications in several fields, including differential equations, pattern recognition, and image and signal processing. However, computing the generalized Fourier…

Given a representation of a finite group $G$ over some commutative base ring $\mathbf{k}$, the cofixed space is the largest quotient of the representation on which the group acts trivially. If $G$ acts by $\mathbf{k}$-algebra automorphisms,…

The graphical realization of a given degree sequence and given partition adjacency matrix simultaneously is a relevant problem in data driven modeling of networks. Here we formulate common generalizations of this problem and the Exact…

Let T be an n by n zero-square matrix over a commutative unital ring R. We show that T is similar to a multiple of E_1n if R is a GCD domain and n = 2, if R is a GCD domain with 2 not zero divisor and n = 3, but there are matrices which are…

We obtain defining equations of the smooth equivariant compactification of the Grassmannian of the complex associative $3$-planes in $\C^7$, which is the parametrizing variety of all quaternionic subalgebras of the algebra of complex…

We introduce a new family of Generalised Parton Distribution models able to fulfil by construction all the theoretical properties imposed by QCD. These models are built on standard Parton Distribution Functions and extended to off-forward…

Let X be a separable Banach space which admits a separating polynomial; in particular X a separable Hilbert space. Let $f:X \rightarrow R$ be bounded, Lipschitz, and $C^1$ with uniformly continuous derivative. Then for each {\epsilon}>0,…

A parquet approximation (generalized ladder diagrams) in matrix models is considered. By means of numerical calculations we demonstrate that in the large $N$ limit the parquet approximation gives an excellent agreement with exact results.

We study the numerical approximation of a coupled hyperbolic-parabolic system by a family of discontinuous Galerkin space-time finite element methods. The model is rewritten as a first-order evolutionary problem that is treated by the…

This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…

We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…

We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

A wide range of optimization problems can often be written in terms of generalized convex functions (GCFs). When this structure is present, it can convert certain nested bilevel objectives into single-level problems amenable to standard…