Related papers: Semialgebric rank-one convex hulls: 2x2 triangular…

A novel 2-D method for computing the convex hull of a sufficiently dense set of n integer points is introduced. The approach employs a ranking function that avoids sorting the points directly thus reducing the overall time complexity. The…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

We study algebraic properties of full rank 1 algebras in a general framework and derive a method to verify if one such matrix polynomial sub-algebra is bispectral. We give two examples illustrating the method. In the first one, we consider…

In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…

We show that every semialgebraic set admits a semialgebraic triangulation such that each closed simplex is $C^1$ differentiable. As an application, we give a straightforward definition of the integration $\int_X \omega$ over a compact…

We study families of faces for convex semi-algebraic sets via the normal cycle which is a semi-algebraic set similar to the conormal variety in projective duality theory. We propose a convex algebraic notion of a "patch" -- a term recently…

We consider the class of non-negative rank-one convex isotropic integrands on $\mathbb{R}^{n\times n}$ which are also positively $p$-homogeneous. If $p \leq n = 2$ we prove, conditional on the quasiconvexity of the Burkholder integrand,…

In this paper we present some linear algebra behind quadratic parts of quadratically flat complex points of codimension two real submanifold in a complex manifold. Assuming some extra nondegenericity and using the result of Hong, complete…

The still-unsolved problem of determining the set of eigenvalues realized by $n$-by-$n$ doubly stochastic matrices, those matrices with row sums and column sums equal to $1$, has attracted much attention in the last century. This problem is…

This paper concerns the notion of a symmetric algebra and its generalization to a quasi-symmetric algebra. We study the structure of these algebras in respect to their hull-kernel regularity and existence of some ideals, especially the…

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and…

Let $E$ be an elliptic curve over a number field $K$ defined by a monic irreducible cubic polynomial $F(x)$. When $E$ is \textit{nice} at all finite primes of $K$, we bound its $2$-Selmer rank in terms of the $2$-rank of a modified ideal…

L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…

We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…