Related papers: Enumerative and planar combinatorics of trivariate…
In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…
Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from mathematical models to real-world problems. Many studies…
Univariate delta Gon\v{c}arov polynomials arise when the classical Gon\v{c}arov interpolation problem in numerical analysis is modified by replacing derivatives with delta operators. When the delta operator under consideration is the…
The goal of this paper is to solve a class of high-order polynomial benchmark optimization problems, including the Goldstein-Price problem and the Three Hump Camel Back problem. By using a generalized canonical duality theory, we are able…
We consider a discrete classical integrable model on the 3-dimensional cubic lattice. The solutions of this model can be used to parameterize the Boltzmann weights of the different 3-dimensional spin models. We have found the general…
The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the…
A general fusion method to find solutions to the reflection equation in higher spin representations starting from the fundamental one is shown. The method is illustrated by applying it to obtaining the $K$ diagonal boundary matrices in an…
In this, largely expository, note, we show how the simplicial structure of the moduli spaces of stable rational curves with marked points allows to produce explicit equations for these spaces. The key argument is an elementary combinatorial…
Two discretizations of the vector nonlinear Schrodinger (NLS) equation are studied. One of these discretizations, referred to as the symmetric system, is a natural vector extension of the scalar integrable discrete NLS equation. The other…
The Taylor resolution is a fundamental object in the study of free resolutions over the polynomial ring, due to its explicit formula, cellular/combinatorial structure, and applicability to any and all monomial ideals. This paper generalizes…
It is known that there exist complex solvmanifolds $(\Gamma\backslash G,J)$ whose canonical bundle is trivialized by a holomorphic section which is not invariant under the action of $G$. The main goal of this article is to classify the…
A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$. An anti-forcing set is the symmetric concept: a set $S$ of elements is called an anti-forcing set…
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…
We are interested in the numerical solution of nonsymmetric linear systems arising from the discretization of convection-diffusion partial differential equations with separable coefficients and dominant convection. Preconditioners based on…
A cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
We characterize the rational solutions to a KdV-like equation which are generated from polynomial solutions to the corresponding generalized bilinear equation. We use a particular class of polynomials satisfying a quadratic difference…