Related papers: Multisum Sets
Using linear algebraic methods we show that every (possibly infinite-dimensional) representation of a quiver with underlying graph $A_{\infty, \infty}$ is Krull-Schmidt, as long as the arrows in the quiver eventually point outward.
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
Given a totally positive matrix, can one insert a line (row or column) between two given lines while maintaining total positivity? This question was first posed and solved by Johnson and Smith who gave an algorithm that results in one…
Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…
Let $\mathfrak{L}$ be a collection of $L$ lines in $\R^3$ and $J$ the set of joints formed by $\mathfrak{L}$, i.e. the set of points each of which lies in at least 3 non-coplanar lines of $\mathfrak{L}$. It is known that $|J| \lesssim…
We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of…
In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The aim of this article is to show that systems of linear partial differential equations on filtered manifolds, which are of weighted finite type, can be canonically rewritten as first order systems of a certain type. This leads immediately…
Recent work of C. Fefferman and the first author has demonstrated that the linear system of equations \begin{equation*} \sum_{j=1}^M A_{ij}(x)F_j(x)=f_i(x)\hspace{.2in} (i=1,...,N), \end{equation*} has a $C^m$ solution $F=(F_1,...,F_M)$ if…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
Some examples of naturally arising multisum $q$-series which turn out to have representations as fermionic single sums are presented. The resulting identities are proved using transformation formulas from the theory of basic hypergeometric…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
A refinement of the classic equivalence relation among Cauchy sequences yields a useful infinitesimal-enriched number system. Such an approach can be seen as formalizing Cauchy's sentiment that a null sequence "becomes" an infinitesimal. We…
An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related…
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…
In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
Almost forty years ago, C.T.C. Wall systematically analyzed the set of "thickenings" of a finite CW complex. Of the results he obtained, probably the most computationally important is the "suspension theorem," which is an exact sequence…