相关论文: On sets of commuting and anticommuting Paulis
We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…
The $d^2$ Pauli operators attached to a composite qudit in dimension $d$ may be mapped to the vectors of the symplectic module $\mathcal{Z}_d^{2}$ ($\mathcal{Z}_d$ the modular ring). As a result, perpendicular vectors correspond to…
In this paper, we study maximal antipodal sets in simply connected exceptional compact symmetric spaces. Combining our results with the existing literature, we obtain a complete classification of maximal antipodal sets in all such spaces.…
The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. In particular we…
In this paper we discuss some of the key properties of sum-free subsets of abelian groups. Our discussion has been designed with a broader readership in mind, and is hence not overly technical. We consider answers to questions like: how…
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
We describe the commuting graph of a Rees matrix semigroup over a group and investigate its properties: diameter, clique number, girth, chromatic number and knit degree. The maximum size of a commutative subsemigroup of a Rees matrix…
The aim of this paper is a characterization of great antipodal sets of complex Grassmannian manifolds as certain designs with the smallest cardinalities.
We define the positive diameter of a finite group $G$ with respect to a generating set $A\subset G$ to be the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A$. This…
Let $R$ be a finite local ring of odd characteristic and $\beta$ a non-degenerate symmetric bilinear form on $R^2$. In this short note, we determine the largest possible cardinality of pairwise orthogonal sets of unimodular vectors in…
We give an explicit classification of maximal antipodal sets in any irreducible compact symmetric space except for spin groups and half spin groups, and some quotient symmetric spaces associated to them.
We compute for reflection groups of type $A,B,D,F_4,H_3$ and for dihedral groups a statistic counting the maximal cardinality of a set of elements in the group whose generalized inversions yield the full set of inversions and which are…
We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.
We extend the concepts of antimorphism and antiautomorphism of the additive group of integers modulo $n$, given by Gaitanas Konstantinos, to abelian groups. We give a lower bound for the number of antiautomorphisms of cyclic groups of odd…
We provide a construction of sets of (d/2+1) mutually unbiased bases (MUBs) in dimensions d=4,8 using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the…
We present an algorithmic framework for computing anti-chains of maximum size in geometric posets. Specifically, posets in which the entities are geometric objects, where comparability of two entities is implicitly defined but can be…
The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of $(n+1)$-element chains in the power…
In this paper we discuss large cardinals and compactness theorems in abelian group theory. More specifically, we generalize two classical compactness results for free abelian groups to the broader context of direct sums of cyclic groups.
Motivated by the set-antiset method for codes over permutations under the infinity norm, we study anticodes under this metric. For half of the parameter range we classify all the optimal anticodes, which is equivalent to finding the maximum…