Related papers: Pairwise transitive 2-designs

Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…

We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…

We describe the groups of automorphisms of two generated free braided associative algebras with involutive diagonal braidings over a field of characteristic $\neq 2$. Depending on the form of the diagonal involutive braiding, five different…

In this survey, we relate frame theory and quantum information theory, focusing on quantum 2-designs. These are arrangements of weighted subspaces which are in a specific sense optimal for quantum state tomography. After a brief…

Just as links may be algebraically described as certain morphisms in the category of tangles, compact surfaces smoothly embedded in R^4 may be described as certain 2-morphisms in the 2-category of `2-tangles in 4 dimensions'. In this…

We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups ${\mathbb Z}_n$, symmetric groups $S_n$ and quantum symmetric groups…

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

We consider a specific %piecewise rotation of the plane that is continuous on two half-planes, class of piecewise rotations of the plane that are continuous on two half-planes, as studied in \cite{Bosh.Goet.03}, \cite{Goet.Quas.09} and…

Building upon Dyson's fundamental 1962 article known in random-matrix theory as 'the threefold way', we classify disordered fermion systems with quadratic Hamiltonians by their unitary and antiunitary symmetries. Important examples are…

We study an explicit description of semibricks and 2-term simple-minded collections over preprojective algebras of type $A$ via arc diagrams. We provide a bijection between the set of noncrossoing arc diagrams (resp. the set of double arc…

We construct a complex of toric varieties we call the quasisymmetric Grassmannian inside the Grassmannian of $r$-planes in $\mathbb{C}^n$. Each irreducible component is a positroid variety and an $S_n$ translate of a toric Richardson…

Bifurcation with symmetry is considered in the case of an isotropy subgroup with a two-dimensional fixed point subspace and non-zero quadratic terms. In general, there are one or three branches of solutions, and five qualitatively different…

Nonhamiltonian interaction of hamiltonian systems is considered. Dynamical equations are constructed by use of symmetric designs on Lie algebras. The results of analysis of these equations show that some class of symmetric designs on Lie…

We investigate the topological theory obtained by twisting the N=(2,2) supersymmetric nonlinear sigma model with target a bihermitian space with torsion. For the special case in which the two complex structures commute, we show that the…

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we study 4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of skew-symmetric…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

We prove that the automorphism group of a general complete intersection $X$ in a projective space is trivial with a few well-understood exceptions. We also prove that the automorphism group of a complete intersection $X$ acts on the…

We consider a code to be a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of vertices, not in the code, at distance $s$ from some codeword, but not distance less than $s$ from any codeword. A…

In this paper we classify all 4+1 cosmological models where the spatial hypersurfaces are connected and simply connected homogeneous Riemannian manifolds. These models come in two categories, multiply transitive and simply transitive…

2-stratifolds are a generalization of 2-manifolds in that there are disjoint simple closed curves where several sheets meet. They arise in the study of categorical invariants of 3-manifolds and may have applications to topological data…