Related papers: Bijectivity of a generalized Pak-Stanley labeling

The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive…

We define a birational map between labelings of a rectangular poset and its associated trapezoidal poset. This map tropicalizes to a bijection between the plane partitions of these posets of fixed height, giving a new bijective proof of a…

Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and connecting each label with its corresponding feature using…

Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…

In multi-instance (MI) learning, each object (bag) consists of multiple feature vectors (instances), and is most commonly regarded as a set of points in a multidimensional space. A different viewpoint is that the instances are realisations…

We provide a systematic classification of multiparticle entanglement in terms of equivalence classes of states under stochastic local operations and classical communication (SLOCC). We show that such an SLOCC equivalency class of states is…

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. The regions are the connected components of the complement of these hyperplanes. By a theorem of Zaslavsky, the number of regions of a hyperplane…

G.W. Mackey's celebrated obstruction theory for projective representations of locally compact groups was remarkably generalized by J. M. G. Fell and R. S. Doran to the wide area of saturated Banach *-algebraic bundles. Analogous obstruction…

Poor generalization is one symptom of models that learn to predict target variables using spuriously-correlated image features present only in the training distribution instead of the true image features that denote a class. It is often…

We use the results of our companion paper arXiv:2502.20444, which explores the equivariant generalization of the constant-map contribution in topological string theory on toric Calabi--Yau manifolds $X$, to establish a holographic…

The bottom-up saliency, an early stage of humans' visual attention, can be considered as a binary classification problem between center and surround classes. Discriminant power of features for the classification is measured as mutual…

A bijection $\Phi$ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the…

Multi-label image classification is a critical task in machine learning that aims to accurately assign multiple labels to a single image. While existing methods often utilize attention mechanisms or graph convolutional networks to model…

Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we…

We introduce the class of bilateral parking procedures on the integer line. While cars try to park in the nearest available spot to their right in the classical case, we consider more general parking rules that allow cars to use the nearest…

A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…

For a connected semisimple Lie group $G$ we describe an explicit collection of correspondences between the admissible dual of $G$ and the admissible dual of the Cartan motion group associated with $G$. We conjecture that each of these…