Related papers: An algebraic approach to symmetric extended formul…
It is shown how to define difference equations on particular lattices $\{x_n\}$, $n\in\mathbb{Z}$, made of values of an elliptic function at a sequence of arguments in arithmetic progression (elliptic lattice). Solutions to special…
In a classical Hamiltonian theory with second class constraints the phase space functions on the constraint surface are observables. We give general formulas for extended observables, which are expressions representing the observables in…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
An algebraic technique adapted to the problems of the fundamental theoretical physics is presented. The exposition is an elaboration and an extension of the methods proposed in previous works by the aut
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
Let k be an algebraically closed field. Given an extension A : B of finite-dimensional k- algebras, we establish criteria ensuring that the representation-theoretic notion of polynomial growth is preserved under ascent and descent. These…
In [14], B-convexity was defined as an appropriate Painlev\'e-Kuratowski limit of linear convexities. More recently, an alternative algebraic formulation over the entire Euclidean vector space was proposed in [9] and [10]. The issue with…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…
When building a cylindrical algebraic decomposition (CAD) savings can be made in the presence of an equational constraint (EC): an equation logically implied by a formula. The present paper is concerned with how to use multiple ECs,…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…
We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…
The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the…
Extremal length is a classical tool in 1-dimensional complex analysis for building conformal invariants. We propose a higher-dimensional generalization for complex manifolds and provide some ideas on how to estimate and calculate it. We…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…