Related papers: Toric Border Bases
The Cox ring provides a coordinate system on a toric variety analogous to the homogeneous coordinate ring of projective space. Rational maps between projective spaces are described using polynomials in the coordinate ring, and we generalise…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
We interpret and develop a theory of loop algebras as torsors (principal homogeneous spaces) over Laurent polynomial rings . As an application, we recover Kac's realization of affine Kac-Moody Lie algebras.
We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…
The super Macdonald polynomials indexed by the super partitions form a basis of the level zero super Fock module (combinatorial representation) of the quantum toroidal algebra $\mathcal{U}_{q,t}(\widehat{\widehat{\mathfrak{gl}}}_{1|1})$.…
It has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact…
Invariant torus are constructed under assumption that the homogeneous system admits an exponential dichotomy on the semi-axes. The main result is closely related with the well-known Palmer's lemma and results of Boichuk A.A., Samoilenko…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
The main aim of the article is to give a simple and conceptual account for the correspondence (originally described by Bodini, Gardy, and Jacquot) between $\alpha$-equivalence classes of closed linear lambda terms and isomorphism classes of…
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander…
We aim to completely formalize the rough topological analysis of integrable Hamiltonian systems admitting analytical solutions such that the initial phase variables along with the time derivatives of the auxiliary variables are expressed as…
The notion of Lyndon word and Lyndon factorization has shown to have unexpected applications in theory as well in developing novel algorithms on words. A counterpart to these notions are those of inverse Lyndon word and inverse Lyndon…
We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree. We are able to compute the Grobner basis and Markov basis of the toric…
This short note describes the benefit one obtains from a specific construction of a family of parametrices for a class of elliptic boundary value problems perturbed by non-linear terms of product type. The construction is based on the…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
An asymptotic theory is developed for general non-integrable boundary quantum field theory in 1+1 dimensions based on the Langrangean description. Reflection matrices are defined to connect asymptotic states and are shown to be related to…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
In this paper we study nonlinear second-order differential inclusions involving the ordinary vector $p$-Laplacian, a multivalued maximal monotone operator and nonlinear multivalued boundary conditions. Our framework is general and unifying…