Related papers: Root Cross Z-Complementary Pairs with Large ZCZ Wi…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…
The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number $z$ and its conjugate $\bar{z}$, and this class can be…
Given an irreducible root system, the Worpitzky-compatible subsets are defined by a geometric property of the alcoves inside the fundamental parallelepiped of the root system. This concept is motivated and mainly understood through a…
We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…
Two subsets $A$ and $B$ of a ground set $X$ are \emph{crossing} if none of the four sets $A\setminus B,B\setminus A,A\cap B, X\setminus (A\cup B)$ are empty. Almost fifty years ago, Karzanov and Lomonosov conjectured that every family of…
The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…
A "biased expansion" of a graph is a kind of branched covering graph with additional structure related to combinatorial homotopy of circles. Some but not all biased expansions are constructed from groups ("group expansions"); these include…
A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…
We introduce a symmetry class for higher dimensional partitions - fully complementary higher dimensional partitions (FCPs) - and prove a formula for their generating function. By studying symmetry classes of FCPs in dimension 2, we define…
For any rational functions with complex coefficients $A(z), B(z)$ and $C(z)$, where $A(z)$, $C(z)$ are not identically zero, we consider the sequence of rational functions $H_{m}(z)$ with generating function $\sum…
Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain…
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
We study a very large family of graphs, the members of which comprise disjoint paths of cliques with extremal cliques identified. This broad characterisation naturally generalises those of various smaller families of graphs having…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…
Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…
We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…
We introduce a series of $\Z_2^n$-graded quasialgebras $\bbP_n(m)$ which generalizes Clifford algebras, higher octonions, and higher Cayley algebras. The constructed series of algebras and their minor perturbations are applied to contribute…
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…