Related papers: Constructing Infinite Sets of Orthogonal Exponenti…

We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using separately two polynomial identities of Kusraeva involving the root mean power…

In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…

We give a moderately motivated exposition of exponentiable locales and the construction of exponentials in $\textsf{Loc}$, without assuming prior knowledge of exponential topological spaces or continuous posets.

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

Let H[N] denote the tensor product of n finite dimensional Hilbert spaces H(r). A state |phi> of H[N] is separable if |phi> is the tensor product of states in the respective product spaces. An orthogonal unextendible product basis is a…

We present a new explicit family of polynomials orthogonal on the unit circle with a dense point spectrum. This family is expressed in terms of q-hypergeometric function of type ${_2}\phi_1$. The orthogonality measure is the wrapped…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

For a certain class of finite posets, we prove that all their irreducible orthoscalar representations are finite-dimensional and describe those, for which there exist essential (non-degenerate) irreducible orthoscalar representations.

We construct open sets of degenerate unfoldings of heterodimensional cycles of any co-index $c>0$ and homoclinic tangencies of arbitrary codimension $c>0$. These sets are known to be the support of unexpected phenomena in families of…

We start from a study of the density-potential relation for classical homeoids in terms of an asymptotic expansion for small deviations from spherical symmetry. We then show that such expansion is a useful device that allows us to construct…

Dyadic rationals are rationals whose denominator is a power of $2$. We define dyadic $n$-dimensional convex sets as the intersections with $n$-dimensional dyadic space of an $n$-dimensional real convex set. Such a dyadic convex set is said…

In this article we construct closed, isospectral, non-isometric locally symmetric manifolds. We have three main results. First, we construct arbitrarily large sets of closed, isospectral, non-isometric manifolds. Second, we show the growth…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…

We introduce the concept of numeraires of convex sets in the nonnegative orthant of the topological vector space of all random variables built over a probability space. A necessary and sufficient condition for an element of a convex set to…