Related papers: A primal-dual formulation for certifiable computat…

In this paper we design a new primal-dual algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint achieving the optimal approximation of $(1-1/e)$. This…

The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1,x2,...]. We suggest the "prism tableau model" for these polynomials. A novel aspect of this alternative to earlier results is that it directly…

We derive an exact representation of the massless Schwinger model on the lattice in terms of dual variables which are configurations of loops, dimers and plaquette occupation numbers. When expressed with the dual variables the partition sum…

We propose a new approach for the solution of initial value problems for integrable evolution equations in the periodic setting based on the unified transform. Using the nonlinear Schr\"odinger equation as a model example, we show that the…

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

We present the application of the Schur-Weyl duality in the one-dimensional Hubbard model in the case of half-filled system of any numer of atoms. We replace the actions of the dual symmetric and unitary groups in the whole Hilbert space by…

It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…

We propose a primal-dual backward reflected forward splitting method for solving structured primal-dual monotone inclusion in real Hilbert space. The algorithm allows to use the inexact computations of the Lipschitzian and cocoercive…

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.…

An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…

For a large class of Abelian lattice models with sign problems, including the case of non-zero chemical potential, duality maps models with complex actions into dual models with real actions. For extended regions of parameter space,…

Let X be the flag variety of the symplectic group. We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of X. We use these polynomials to…

This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…

The secure domination problem, a variation of the domination problem with some important real-world applications, is considered. Very few algorithmic attempts to solve this problem have been presented in literature, and the most successful…

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

We prove a root system uniform, concise combinatorial rule for Schubert calculus of_minuscule_ and_cominuscule_ flag manifolds G/P (the latter are also known as "compact Hermitian symmetric spaces"). We connect this geometry to the poset…

Bilevel programming problems frequently arise in real-world applications across various fields, including transportation, economics, energy markets and healthcare. These problems have been proven to be NP-hard even in the simplest form with…

Polynomial solutions to the KP hierarchy are known to be parametrized by a cone over an infinite-dimensional Grassmann variety. Using the notion of Schubert derivation on a Grassmann algebra, we encode the classical Pl\"ucker equations of…