Related papers: The solution of the complete nontrivial cycle inte…

A hypercycle equation with infinitely many types of macromolecules is formulated and studied both analytically and numerically. The resulting model is given by an integro-differential equation of the mixed type. Sufficient conditions for…

Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…

We prove a generalized mirror conjecture for non-negative complete intersections in symplectic toric manifolds. Namely, we express solutions of the PDE system describing quantum cohomology of such a manifold in terms of suitable…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Short nonstandard proofs are given for some results about infinite systems of equations in infinitely many variables.

We give a proof of a Martingale Representation Theorem using the methods of nonstandard analysis.

In this paper, we first show the existence of solutions to the following system of nonlinear equations \begin{eqnarray*}\left\{\begin{array}{l} a_{11}x_1+a_{12}x_2+a_{13}x_3+\cdots+a_{1n}x_{n} =…

We prove that mutation of complete $\tau$-exceptional sequences is transitive for $\tau$-tilting finite algebras.

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

An explicit perturbative solution to all orders is given for a general class of nonlinear differential equations. This solution is written as a sum indexed by rooted trees and uses the Green function of a linearization of the equations. The…

A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known…

We state and prove a correct version of a theorem presented in an earlier paper.

This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving…

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Consider the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we…

We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.

We provide a theory to establish the existence of nonzero solutions of perturbed Hammerstein integral equations with deviated arguments, being our main ingredient the theory of fixed point index. Our approach is fairly general and covers a…

We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…