Related papers: An algebraic approach to symmetric extended formul…
We explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
Enhancing and essentially generalizing previous results on a class of (1+1)-dimensional nonlinear wave and elliptic equations, we apply several new techniques to classify admissible point transformations within this class up to the…
We propose and analyze a symmetric version of the Zassenhaus formula for disentangling the exponential of two non-commuting operators. A recursive procedure for generating the expansion up to any order is presented which also allows one to…
The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward…
We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.
We deal with various splitting methods in algebraic logic. The word `splitting' refers to splitting some of the atoms in a given relation or cylindric algebra each into one or more subatoms obtaining a bigger algebra, where the number of…
Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
Non-trivial extensions of the three dimensional Poincar\'e algebra, beyond the supersymmetric one, are explicitly constructed. These algebraic structures are the natural three dimensional generalizations of fractional supersymmetry of order…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent non-convex sets and are generalizations of zonotopes, polytopes, and Taylor models.…
Symmetry is a powerful tool for finding analytical solutions to differential equations, both partial and ordinary, via the similarity variables or via the invariance of the equation under group transformations. It is the largest group of…
We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…
We propose a new contact relation between polytopes. Intuitively, we say that two polytopes are in strong contact if a small enough object can pass from one of them to the other while remaining in their union. In the first half of the paper…
We present slight refinements of known general lower and upper bounds on sizes of extended formulations for polytopes. With these observations we are able to compute the extension complexities of all 0/1-polytopes up to dimension 4. We…
An algebraic method is devised to look for non-local symmetries of the pseudopotential type of nonlinear field equations. The method is based on the use of an infinite-dimensional subalgebra of the prolongation algebra $L$ associated with…
We consider a class of stochastic programs whose uncertain data has an exponential number of possible outcomes, where scenarios are affinely parametrized by the vertices of a tractable binary polytope. Under these conditions, we propose a…
The main thrust of our current work is to exploit very specific characteristics of a given problem in order to acquire improved compactness for supercritical problems and to prove existence of new types of solutions. To this end, we shall…