Related papers: Solvability of linear equations within weak mixing…
Recently, finding the sparsest solution of an underdetermined linear system has become an important request in many areas such as compressed sensing, image processing, statistical learning, and data sparse approximation. In this paper, we…
The paper concerns the solvability by quadratures of linear differential systems, which is one of the questions of differential Galois theory. We consider systems with regular singular points as well as those with (non-resonant) irregular…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
The problem of computing minimally sparse solutions of under-determined linear systems is $NP$ hard in general. Subsets with extra properties, may allow efficient algorithms, most notably problems with the restricted isometry property (RIP)…
Our purpose in this paper is to study when a planar differential system polynomial in one variable linearizes in the sense that it has an inverse integrating factor which can be constructed by means of the solutions of linear differential…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…
Conditions for the unique solvability of the Cauchy problem for a family of scalar functional differential equations are obtained. These conditions are sufficient for the solvability of the Cauchy problem for every equation from the family…
In this short paper we identify special systems of (an arbitrary number) N of first-order Difference Equations with nonlinear homogeneous polynomials of arbitrary degree M in their right-hand sides, which feature very simple explicit…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
In the present paper, a class of new simple modules over the $N=1$ Ramond algebra are constructed, which are induced from simple modules over some finite dimensional solvable Lie superalgebras. These new modules are simple restricted…
We consider a class of systems of difference equations defined on an elementary quadrilateral of the ${\mathbb{Z}}^2$ lattice, define their eliminable and dynamical variables, and demonstrate their use. Using the existence of infinite…
We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from combinatorial design theory and increase the bounds to which…
This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…
We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…
We study function-valued solutions of a class of stochastic partial differential equations, involving operators with polynomially bounded coefficients. We consider semilinear equations under suitable parabolicity hypotheses. We provide…
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…
A classical question in combinatorial number theory asks whether an equation has a solution inside a particular subset of its domain. The Rado's Theorem gives a set of necessary and sufficient conditions for a systems of linear equations to…
In this paper, we derive some necessary and sufficient solvability conditions for some systems of one sided coupled Sylvester-type real quaternion matrix equations in terms of ranks and generalized inverses of matrices. We also give the…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…