Related papers: Shapes and recession cones in mixed-integer convex…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…
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…
We study a class of polyhedra associated to marked posets. Examples of these polyhedra are Gelfand-Tsetlin polytopes and cones, as well as Berenstein-Zelevinsky polytopes, all of which have appeared in the representation theory of…
We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
In this paper we define the notion of monic representation for the $C^*$-algebras of finite higher-rank graphs with no sources, and undertake a comprehensive study of them. Monic representations are the representations that, when restricted…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…
In this paper, we investigate the constraint typology of mixed-integer linear programming MILP formulations. MILP is a commonly used mathematical programming technique for modelling and solving real-life scheduling, routing, planning,…
Implicit Neural Representations (INRs) are widely used to encode data as continuous functions, enabling the visualization of large-scale multivariate scientific simulation data with reduced memory usage. However, existing INR-based methods…
It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP…
A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…
We consider $C$-pseudo-cones, that is, closed convex sets $K \subset{\mathbb R}^n$ with $o\notin K\subset C$, for which $C$ is the recession cone. Here $C$ is a given closed convex cone in ${\mathbb R}^n$, pointed and with nonempty…
This paper focuses on vertices of the master corner polyhedra $P(G,g_0),$ the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of $P(G,g_0)$ to…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
Working in the dense loop representation, we use the planar Temperley-Lieb algebra to build integrable lattice models called logarithmic minimal models LM(p,p'). Specifically, we construct Yang-Baxter integrable Temperley-Lieb models on the…
Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…
Mixed integer predictive control deals with optimizing integer and real control variables over a receding horizon. The mixed integer nature of controls might be a cause of intractability for instances of larger dimensions. To tackle this…