Related papers: A partition of the hypercube into maximally nonpar…
Combinatorial mechanical metamaterials are made of anisotropic, flexible blocks, such that multiple metamaterials may be constructed using a single block type, and the system's response strongly depends on the mutual orientations of the…
The energy spectra of two different quantum systems are paired through supersymmetric algorithms. One of the systems is Hermitian and the other is characterized by a complex-valued potential, both of them with only real eigenvalues in their…
Independent parallel q-ary symmetric channels are a suitable transmission model for several applications. The proposed weighted-Hamming metric is tailored to this setting and enables optimal decoding performance. We show that some…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
Graphs and recently hypergraphs have been known as an important tool for considering different properties of quantum many-body systems. In this paper, we study a mapping between an important class of quantum systems namely quantum…
A map $\phi:M_m(\bC)\to M_n(\bC)$ is decomposable if it is of the form $\phi=\phi_1+\phi_2$ where $\phi_1$ is a CP map while $\phi_2$ is a co-CP map. It is known that if $m=n=2$ then every positive map is decomposable. Given an extremal…
Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular t-partite hypergraphs whose minimum distance improves earlier estimates…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving…
We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…
We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…
Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…
Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…
Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…
Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the…
The controlled generation and identification of quantum correlations, usually encoded in either qubits or continuous degrees of freedom, builds the foundation of quantum information science. Recently, more sophisticated approaches,…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a $b$-matching every vertex $v$ has an associated bound $b_v$, and a maximum $b$-matching is a…