Related papers: Pak-Stanley labeling for Central Graphical Arrange…

A complete mapping of a group $G$ is a bijection $\phi\colon G\to G$ such that $x\mapsto x\phi(x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a complete mapping whenever $\prod_{x\in G} x$ is the…

Let $\mathcal A\subset\mathbb P^{k-1}$ be a rank $k$ arrangement of $n$ hyperplanes, with the property that any $k$ of the defining linear forms are linearly independent (i.e., $\mathcal A$ is called $k-$generic). We show that for any…

Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear…

A Cayley graph over a group $G$ is said to be central if its connection set is a normal subset of $G$. We prove that every central Cayley graph over a simple group $G$ has at most two pairwise nonequivalent Cayley representations over $G$…

Let G be a graph whose edges are labeled by ideals of a commutative ring. We introduce a generalized spline, which is a vertex-labeling of G by elements of the ring so that the difference between the labels of any two adjacent vertices lies…

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we…

This work characterizes the general form of a bijective linear map $\Psi:\mathscr{M}_n(\mathbb{C}) \to \mathscr{M}_n(\mathbb{C})$ such that $[\Psi(A_1),~\Psi(A_2)]=D_2$ whenever $[A_1,~A_2]=D_1$ where $D_1~\text{and}~D_2$ are fixed…

Semantic context is an important and useful cue for scene parsing in complicated natural images with a substantial amount of variations in objects and the environment. This paper proposes Spatially Constrained Location Prior (SCLP) for…

Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…

A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\rm…

Stacks have become a prevalent tool in studying problems with connections to String Theory, hence we see a need to develop a theory of supersymmetric stacks proper. We first define derived stacks on $\mathbb{Z}_2$-bi-graded k-modules…

The notion of parking sequences is a new generalization of parking functions introduced by Ehrenborg and Happ. In the parking process defining the classical parking functions, instead of each car only taking one parking space, we allow the…

We settle a conjecture of B\'ona regarding the log-concavity of a certain statistic on parking functions by utilizing recent log-concavity results on matroids. This result allows us to also prove that connected, labeled graphs graded by…

A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from…

We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typically, labeling models either use internal labels, which must…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

The Banach-Picard iteration is widely used to find fixed points of locally contractive (LC) maps. This paper extends the Banach-Picard iteration to distributed settings; specifically, we assume the map of which the fixed point is sought to…