Related papers: A Complementarity Partition Theorem for Multifold …
We extend Halphen's theorem which characterizes the solutions of certain $n$th-order differential equations with rational coefficients and meromorphic fundamental systems to a first-order $n \times n$ system of differential equations. As an…
Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
We construct integrable Hamiltonian systems on $G/K$, where $G$ is a quasitriangular Poisson Lie group and $K$ is a Lie subgroup arising as the fixed point set of a group automorphism $\sigma$ of $G$ satisfying the classical reflection…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
When $k<n$, we study the coherent systems that come from a BGN extension in which the quotient bundle is strictly semistable. In this case we describe a stratification of the moduli space of coherent systems. We also describe the strata as…
We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Let X be a projective 3-fold with at most Q-factorial terminal singularities on which K_X is nef and big. Suppose the canonical index r(X)>1. For any positive integer m, it is interesting to consider the base point freeness and…
We give three proofs of the following result conjectured by Carriegos, De Castro-Garc\'{\i}a and Mu\~noz Casta\~neda in their work on enumeration of control systems: when $\binom{k+1}{2} \le n < \binom{k+2}{2}$, there are as many partitions…
This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones…
Stone space partitions $\{X_{p}\mid p\in P\}$ satisfying conditions like $\bar{X_{p}}=\bigcup_{q\leqslant p}X_{q}$ for all $p\in P$, where $P$ is a poset or PO system (poset with a distinguished subset), arise naturally in the study both of…
Suppose that $X$ is a projective variety over an algebraically closed field of characteristic $p > 0$. Further suppose that $L$ is an ample (or more generally in some sense positive) divisor. We study a natural linear system in $|K_X + L|$.…
In this paper, we extend Roe's cyclic $1$-cocycle to relative settings. We also prove two relative index theorems for partitioned manifolds by using its cyclic cocycle, which are generalizations of index theorems on partitioned manifolds.…
The famous Michael selection theorem deals with the characterisation of paracompact spaces by continuous selections of lower semi-continuous mappings in Banach spaces. In this paper, we will discuss several equivalent forms of this theorem,…
We present an alternative approach to the vector version of Krasnosel'skii compression-expansion fixed point theorem due to Precup, which is based on the fixed point index. It allows us to obtain new general versions of this fixed point…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
In this paper we propose an algorithm for exact partitioning of high-order models. We define a general class of $m$-degree Homogeneous Polynomial Models, which subsumes several examples motivated from prior literature. Exact partitioning…