Related papers: How to Find New Characteristic-Dependent Linear Ra…
It is "well known" that in linear models: (1) testable constraints on the marginal distribution of observed variables distinguish certain cases in which an unobserved cause jointly influences several observed variables; (2) the technique of…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
This paper deals with variable selection in the regression and binary classification frameworks. It proposes an automatic and exhaustive procedure which relies on the use of the CART algorithm and on model selection via penalization. This…
A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences…
The condition number of solutions to full rank linear least-squares problem are shown to be given by an optimization problem that involves nuclear norms of rank 2 matrices. The condition number is with respect to the least-squares…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
We consider the most general class of linear boundary-value problems for higher-order ordinary differential systems whose solutions and right-hand sides belong to the corresponding Sobolev spaces. For parameter-dependent problems from this…
Let $H\_0, ..., H\_n$ be $m \times m$ matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals. We consider the linear Hankel matrix $H(\vecx)=H\_0+\X\_1H\_1+...+\X\_nH\_n$ and the problem of computing sample points…
In many application domains, networks are observed with node-level features. In such settings, a common problem is to assess whether or not nodal covariates are correlated with the network structure itself. Here, we present four novel…
We show that binary forms of degree n less than seven parameterize rings, generalizing a result of Levi on binary cubic forms parameterizing cubic rings, which can be related to results of Bhargava. The question of whether or not a binary…
All results concern characteristic 2. Two procedures that to every simple Lie algebra assign simple Lie superalgebras, most of the latter new, are offered. We prove that every simple finite-dimensional Lie superalgebra is obtained as the…
In this paper, we focus on the problem of statistical dependence estimation using characteristic functions. We propose a statistical dependence measure, based on the maximum-norm of the difference between joint and product-marginal…
We introduce the most general class of linear boundary-value problems for systems of first-order ordinary differential equations whose solutions belong to the complex H\"older space $C^{n+1,\alpha}$, with $0\leq n\in\mathbb{Z}$ and…
We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
In the article the problem of the integrable classification of nonlinear lattices depending on one discrete and two continuous variables is studied. By integrability we mean the presence of reductions of a chain to a system of hyperbolic…
Over algebraically closed fields of positive characteristic, for simple Lie (super)algebras, and certain Lie (super)algebras close to simple ones, with symmetric root systems (such that for each root, there is minus it of the same…
Neural networks have achieved tremendous success in a large variety of applications. However, their memory footprint and computational demand can render them impractical in application settings with limited hardware or energy resources. In…
A large class of dense linear algebra operations, such as LU decomposition or inversion of a triangular matrix, are usually performed by blocked algorithms. For one such operation, typically, not only one but many algorithmic variants…