Related papers: A combinatorial proof of Cramer's Rule
Linear system solving is one of the main workhorses in applied mathematics. Recently, theoretical computer scientists have contributed sophisticated algorithms for solving linear systems with symmetric diagonally dominant matrices (a class…
To our knowledge, there are two main references [9], [12] regarding the periodical solutions of multi-time Euler-Lagrange systems, even if the multi-time equations appeared in 1935, being introduced by de Donder. That is why, the central…
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…
A method to include multiplicative systematic uncertainties into branching ratio limits was proposed by M. Convery. That solution used approximations which are not necessarily valid. This note provides a solution without approximations and…
The randomized row method is a popular representative of the iterative algorithm because of its efficiency in solving the overdetermined and consistent systems of linear equations. In this paper, we present an extended randomized multiple…
Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…
In Ramanujan's Lost Notebook there is an amazing identity that furnishes infinitely many "almost counterexamples" to the cubic Fermat's Last Theorem, with no indication whatsoever how he discovered it. In 1995, Michael Hirschhorn explained,…
We prove that if the set of unordered pairs of real numbers is colored by finitely many colors, there is a set of reals homeomorphic to the rationals whose pairs have at most two colors. Our proof uses large cardinals and it verifies a…
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…
The famous Bernstein conjecture about optimal node systems in classical polynomial Lagrange interpolation, standing unresolved for about half a century, was solved by T. Kilgore in 1978. Immediately following him, also the additional…
A celebrated theorem due to Bannai-Bannai-Stanton says that if $A$ is a set of points in $\mathbb{R}^{d}$, which determines $s$ distinct distances, then $$|A| \leq {d+s \choose s}.$$ In this note, we give a new simple proof of this result…
We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…
In this paper we continue to study so called ``inverse Born's rule problem'': to construct representation of probabilistic data of any origin by a complex probability amplitude which matches Born's rule. The corresponding algorithm --…
The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…
The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger…
A set system is called union closed if for any two sets in the set system their union is also in the set system. Gilmer recently proved that in any union closed set system some element belongs to at least a $0.01$ fraction of sets, and…