Related papers: Elementary Matrix Decomposition and The Computatio…
We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for…
Let $\ell$ and $p \geq 3$ be different primes. Let $E/\mathbb{Q}_\ell$ and $E'/\mathbb{Q}_\ell$ be elliptic curves with isomorphic $p$-torsion. Assume that $E$ has potentially multiplicative reduction. We classify when all…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
In this paper, we address the problem of identifying linear structural equation models. We first extend the edge set half-trek criterion to cover a broader class of models. We then show that any semi-Markovian linear model can be…
Let $E$ be an elliptic curve defined over $\mathbb Q$. Let $\Gamma$ be a subgroup of $E(\mathbb Q)$ and $P\in E(\mathbb Q)$. In [1], it was proved that if $E$ has no nontrivial rational torsion points, then $P\in\Gamma$ if and only if $P\in…
Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
For a nonlinear ordinary differential equation solved with respect to the highest order derivative and rational in the other derivatives and in the independent variable, we devise two algorithms to check if the equation can be reduced to a…
We consider decompositions of topes of the oriented matroid realizable as the arrangement of coordinate hyperplanes in $\mathbb{R}^{2^t}$, with respect to a distinguished symmetric $2\cdot 2^t$-cycle in its hypercube graph of topes…
We give a systematic construction of semiorthogonal decompositions of derived categories of coherent sheaves on quasi-smooth derived algebraic stacks over $\mathbb{C}$, where the summands are subcategories defined by weight conditions, and…
We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…
A fundamental problem in arithmetic geometry is to determine the image of the mod $N$ Galois representation for all elliptic curves over $\mathbb{Q}$ and integers $N \geq 1$. For a given subgroup $G \le…
This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature are synergized and are compared and contrasted; included in…
We prove several results on torsion points and Galois representations for complex multiplication (CM) elliptic curves over a number field containing the CM field. One result computes the degree in which such an elliptic curve has a rational…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
Darmon's conjecture on a relation between cyclotomic units over real quadratic fields and certain algebraic regulators was recently solved by Mazur and Rubin by using their theory of Kolyvagin systems. In this paper, we formulate a…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…