Related papers: Structure and automorphisms of primitive coherent …
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
Principal Component Analysis (PCA) is a well known procedure to reduce intrinsic complexity of a dataset, essentially through simplifying the covariance structure or the correlation structure. We introduce a novel algebraic, model-based…
In this work we extend the results of [1] where, Semiclassical Selfconsistent Configurations (SSC) formalism was introduced. The scheme combines quantum field theory on a background space-time, semiclassical treatment of gravitation and…
There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosophical justification is provided by a classical theorem of…
We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…
Recall that a non-singular planar quartic is a canonically embedded non-hyperelliptic curve of genus three. We say such a curve is symmetric if it admits non-trivial automorphisms. The classification of (necessarily finite) groups appearing…
We prove a suite of results classifying holomorphic maps between configuration spaces of Riemann surfaces; we consider both the ordered and unordered setting as well as the cases of genus zero, one, and at least two. We give a complete…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
Color Refinement, also known as Naive Vertex Classification, is a classical method to distinguish graphs by iteratively computing a coloring of their vertices. While it is mainly used as an imperfect way to test for isomorphism, the…
We present a deterministic $O(\log \log \log n)$-round low-space Massively Parallel Computation (MPC) algorithm for the classical problem of $(\Delta+1)$-coloring on $n$-vertex graphs. In this model, every machine has a sublinear local…
In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
Contents: Rational functions with given monodromy on generic curves (I. Bouw & S. Wewers); Can deformation rings of group representations not be local complete intersections? (T. Chinburg); Lifting an automorphism group to finite…
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…
We study the class of edge-coloured graphs arising from the graph-theoretic representation of quantum photonic experiments that generate multipartite W-states. Abstracting away physical amplitudes and phases, we introduce W-state graphs:…
We study manifolds endowed with an (almost) even Clifford (hermitian) structure and admitting a large automorphism group. We classify them when they are simply connected and the dimension of the automorphism group is maximal, and also prove…
We study two kinds of generalizations of symmetric block designs to higher dimensions, the so-called $\mathcal{C}$-cubes and $\mathcal{P}$-cubes. For small parameters, all examples up to equivalence are determined by computer calculations.…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…