Related papers: Circulant association schemes on triples
Axial algebras are a class of commutative non-associative algebras which have a natural group of automorphisms, called the Miyamoto group. The motivating example is the Griess algebra which has the Monster sporadic simple group as its…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
We study random perturbations of multidimensional piecewise expanding maps. We characterize absolutely continuous stationary measures (acsm) of randomly perturbed dynamical systems in terms of pseudo-orbits linking the ergodic components of…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…
A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…
We investigate the theory of affine group schemes over a symmetric tensor category, with particular attention to the tangent space at the identity. We show that this carries the structure of a restricted Lie algebra, and can be viewed as…
A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…
In this paper a variety of issues are discussed, Schur ring, $S$-sets, circulant orbits, decimation operator and Hadamard matrices and their relation between them is shown. Firstly we define the complete $S$-sets. Next, we study the…
Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An…
We introduce multi-centered dilatations of rings, schemes and algebraic spaces, a basic algebraic concept. Dilatations of schemes endowed with a structure (e.g. monoid, group or Lie algebra) are in favorable cases schemes endowed with the…
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle…
A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a…
This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…
The resonant modes of two-dimensional elastic elliptical objects are studied from a modal formalism by emphasizing the role of the symmetries of the objects. More precisely, as the symmetry is broken in the transition from the circular disc…
This paper introduces the \textit{truncator} map as a dynamical system on the space of configurations of an interacting particle system. We represent the symbolic dynamics generated by this system as a non-commutative algebra and classify…
In this article, circular arcs are considered both individually and as elements of a piecewise circular curve. The endpoint parameterization proves to be quite advantageous here. The perspective of symplectic geometry provides new vectorial…
Critical phase transitions have proven to be a powerful concept to capture the phenomenology of many systems, including deeply non-equilibrium ones like living systems. The study of these phase transitions has overwhelmingly relied on…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
In this paper we show how to express RNA tertiary interactions via the concepts of tangled diagrams. Tangled diagrams allow to formulate RNA base triples and pseudoknot-interactions and to control the maximum number of mutually crossing…