Related papers: Region level via centralization for hyperplane arr…
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
The purpose of this work is to collect in one place available information on line arrangements known in the literature as braid, monomial, Ceva or Fermat arrangement. They have been studied for a long time and appeared recently in…
We investigate the representation theory of the rational and trigonometric Cherednik algebra of type $GL_n$ by means of combinatorics on periodic (or cylindrical) skew diagrams. We introduce and study standard tableaux and plane partitions…
In this work we investigate connections between superalgebras and their realizations in terms of particles, branes and field theory models. We start from Poincar\'e superalgebras with brane charges and study its representations. The…
We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…
We introduce a method for jointly registering ensembles of partitioned datasets in a way which is both geometrically coherent and partition-aware. Once such a registration has been defined, one can group partition blocks across datasets in…
In the preprint arXiv:2511.07900 we proved that there exists a localizing ring $A_M$ for $A$ an associative ring with unit, and $M=\oplus_{i=1}^rM_i$ a direct sum of $r\geq 1$ simple right $A$-modules. For a homomorphism of associative…
Place classification is a fundamental ability that a robot should possess to carry out effective human-robot interactions. It is a nontrivial classification problem which has attracted many research. In recent years, there is a high…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We provide a systematic enumerative and combinatorial study of geometric cellular diagonals on the permutahedra. In the first part of the paper, we study the combinatorics of certain hyperplane arrangements obtained as the union of $\ell$…
The joint optimization of representation learning and clustering in the embedding space has experienced a breakthrough in recent years. In spite of the advance, clustering with representation learning has been limited to flat-level…
Let $\mathcal{A}$ be a Weyl arrangement in an $\ell$-dimensional Euclidean space. The freeness of restrictions of $\mathcal{A}$ was first settled by a case-by-case method by Orlik and the second author (1993), and later by a uniform…
Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the…
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the…
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
Resource allocation and scheduling are a common problem in various distributed systems. Although widely studied, the state-of-the-art solutions either do not scale or lack the expressive power to capture the most complex instances of the…
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent…
Let $A$ be an abelian scheme of dimension at least four over a $\mathbb{Z}$-finitely generated integral domain $R$ of characteristic zero, and let $L$ be an ample line bundle on $A$. We prove that the set of smooth hypersurfaces $D$ in $A$…
Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…