Related papers: Polynomial Valuations on Vector Lattices

We extend and prove a conjecture of Bengu\c{s}-Lasnier on the parametrization of valuations on a polynomial ring by certain spaces of diskoids.

In 2018, the longest vector problem (LVP) and the closest vector problem (CVP) in $p$-adic lattices were introduced. These problems are closely linked to the orthogonalization process. In this paper, we first prove that every $p$-adic…

This paper is devoted to characterizations classical orthogonal polynomials on quadratic lattices by using a matrix approach. In this form we recover the Hahn, Geronimus, Tricomi and Bochner type characterizations of classical orthogonal…

It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity…

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

We prove some properties of positive polynomial mappings between Riesz spaces, using finite difference calculus. We establish the polynomial analogue of the classical result that positive, additive mappings are linear. And we prove a…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…

We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…

For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrow\Lambda$ of ordered groups, we analyze the structure of the tree formed by all $\Lambda$-valued extensions of $v$ to the polynomial ring $K[x]$. As an…

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…

A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…

We prove that the category of unital hyperarchimedean vector lattices is equivalent to the category of Boolean algebras. The key result needed to establish the equivalence is that, via the Yosida representation, such a vector lattice is…

The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…

A vector topology on a vector space over a topological field is a (not necessarily Hausdorff) topology by which the addition and scalar multiplication are continuous. We prove that, if an isomorphism between the lattice of topologies of two…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

Multi-indexed orthogonal polynomials describe eigenfunctions of exactly solvable shape-invariant quantum mechanical systems in one dimension obtained by the method of virtual states deletion. Multi-indexed orthogonal polynomials are labeled…

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…