Related papers: On linear equations arising in Combinatorics (Part…
In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
A powerful method for solving non-linear first-order ordinary differential equations, which is based on geometrical understanding of the corresponding dynamics of the so called Lie systems, is developed. This method allows us not only to…
In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…
This work is devoted to the study of the existence and sign of Green's functions for first order linear problems with constant coefficients and initial (one point) conditions. We first prove a result on the existence of solutions of $n$-th…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
We investigate a family of representations of Gale-Robinson quivers that are geared towards providing concrete information about the corresponding cluster algebras. In this way, we provide a representation theoretic explanation for known…
Enlarging on Parts I, II, and III we write more equations in the desired format of the extended abstract theory of composites. We focus on a multitude of equations involving higher order derivatives. The motivation is that results and…
The Riccati differential equation is examined in light of its connection to second order linear time varying systems. In that light it becomes the clear generalization for the characteristic equation of linear time invariant systems, and is…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
The formalisation of mathematics is continuing rapidly, however combinatorics continues to present challenges to formalisation efforts, such as its reliance on techniques from a wide range of other fields in mathematics. This paper presents…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
We construct Lagrange interpolating polynomials for a set of points and values belonging to the algebra of real quaternions $H\simeq R_{0,2}$, or to the real Clifford algebra $R_{0,3}$. In the quaternionic case, the approach by means of…
In this study, new master theorems and general formulas of integrals are presented and implemented to solve some complicated applications in different fields of science. The proposed theorems are considered to be generators of new problems,…
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…
We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…
In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…