相关论文: On minimal extended representations of generalized…
We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition,…
We provide a detailed analysis of atomic *-representations of rank 2 graphs on a single vertex. They are completely classified up to unitary equivalence, and decomposed into a direct sum or direct integral of irreducible atomic…
In this paper we study the reducibility, composition series and unitarity of the components of some degenerate principal series representations of $\RMO(p,q)$, $\RMU(p,q)$ and $\SP(p,q)$. This is done by realizing these representations in…
We propose a new directed graphical representation of utility functions, called UCP-networks, that combines aspects of two existing graphical models: generalized additive models and CP-networks. The network decomposes a utility function…
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model $\cal M$ is given and the goal is to…
The p-center problem consists in selecting p centers among M to cover N clients, such that the maximal distance between a client and its closest selected center is minimized. For this problem we propose two new and compact integer…
It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study…
We present a linear time algorithm for computing an implicit linear space representation of a minimum cycle basis (MCB) in weighted partial 2-trees, i.e., graphs of treewidth two. The implicit representation can be made explicit in a…
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…
We investigate two optimization problems on area-proportional rectangle contact representations for layered, embedded planar graphs. The vertices are represented as interior-disjoint unit-height rectangles of prescribed widths, grouped in…
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…
We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…
Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…
A minimal representation of a simple non-compact Lie group is obtained by ``quantizing'' the minimal nilpotent coadjoint orbit of its Lie algebra. It provides context for Roger Howe's notion of a reductive dual pair encountered recently in…
Let $G$ be an even orthogonal quasi-split group defined over a local non-archimedean field $F$. We describe the subspace of smooth vectors of the minimal representation of $G(F),$ realized on the space of square-integrable functions on a…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
From a detailed analysis of cone-jet cross sections in effective field theory, we obtain novel factorization theorems which separate the physics associated with different energy scales present in such processes. The relevant low-energy…
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit…