Related papers: Mixed-integer bilevel representability
This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and…
Bilevel programs model sequential decision interactions between two sets of players and find wide applications in real-world complex systems. In this paper, we consider a bilevel mixed-integer linear program with binary tender, wherein the…
We investigate the category of finite-dimensional representations of twisted hyper loop algebras, i.e., the hyperalgebras associated to twisted loop algebras over finite-dimensional simple Lie algebras. The main results are the…
It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
Suppose a finite group acts on a scheme X and a finite-dimensional Lie algebra g. The corresponding equivariant map algebra is the Lie algebra M of equivariant regular maps from X to g. We classify the irreducible finite-dimensional…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended formulation is constructed by…
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…
The goal of this paper is to derive new classes of valid convex inequalities for quadratically constrained quadratic programs (QCQPs) through the technique of lifting. Our first main result shows that, for sets described by one bipartite…
In this paper we provide a finite-sample and an infinite-sample representer theorem for the concatenation of (linear combinations of) kernel functions of reproducing kernel Hilbert spaces. These results serve as mathematical foundation for…
We analyse the fusion of representations of the triplet algebra, the maximally extended symmetry algebra of the Virasoro algebra at c=-2. It is shown that there exists a finite number of representations which are closed under fusion. These…
The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…
Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…
We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…
Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…
We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…