English
Related papers

Related papers: On Pseudocyclic Association Schemes

200 papers

This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…

Dynamical Systems · Mathematics 2023-09-06 Saeed Zakeri

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple nonsingular derivation, is achieved. It is proved that there exist four…

Classical Analysis and ODEs · Mathematics 2014-01-10 Ilie Burdujan

We define the \emph{curvilinear rank} of a degree $d$ form $P$ in $n+1$ variables as the minimum length of a curvilinear scheme, contained in the $d$-th Veronese embedding of $\mathbb{P}^n$, whose span contains the projective class of $P$.…

Algebraic Geometry · Mathematics 2015-07-07 Edoardo Ballico , Alessandra Bernardi

Given a permutation group $G$, the derangement graph of $G$ is defined with vertex set $G$, where two elements $x$ and $y$ are adjacent if and only if $xy^{-1}$ is a derangement. We establish that, if $G$ is transitive with degree exceeding…

Combinatorics · Mathematics 2026-04-15 Marina Cazzola , Louis Gogniat , Pablo Spiga

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every its algebraic isomorphism to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial isomorphism. We prove that…

Combinatorics · Mathematics 2019-12-17 Grigory Ryabov

In 1993, Muzychuk \cite{muzychuk} showed that the rational Schur rings over a cyclic group $Z_n$ are in one-to-one correspondence with sublattices of the divisor lattice of $n$, or equivalently, with sublattices of the lattice of subgroups…

Rings and Algebras · Mathematics 2009-05-13 Brent Kerby

We compute the alpha invariant of any smooth complex projective spin complete intersection of complex dimension $1 \; ({\rm mod} \; 4)$. We prove that the alpha invariant depends only on the total degree and Pontryagin classes. Our findings…

Differential Geometry · Mathematics 2020-02-18 David Baraglia

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [9]. In this paper, we study the Terwilliger $\mathbb{F}$-algebras of factorial…

Combinatorics · Mathematics 2025-10-28 Jiu-Yang He , Yu Jiang

From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…

Dynamical Systems · Mathematics 2014-12-17 Alexei Kanel-Belov , Ivan Mitrofanov

We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs…

Quantum Physics · Physics 2019-05-14 Benjamin Musto , David Reutter , Dominic Verdon

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…

Combinatorics · Mathematics 2024-05-14 Grahame Erskine , Terry S. Griggs

Let A be a finite dimensional, unital, and associative algebra which is endowed with a non-degenerate and invariant inner product. We give an explicit description of an action of cyclic Sullivan chord diagrams on the normalized Hochschild…

Quantum Algebra · Mathematics 2007-05-23 Thomas Tradler , Mahmoud Zeinalian

An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…

Signal Processing · Electrical Eng. & Systems 2022-03-08 Kathryn Beck , Mahya Ghandehari

A quasi-schemoid is a small category with a particular partition of the set of morphisms. We define a homotopy relation on the category of quasi-schemoids and study its fundamental properties. As a homotopy invariant, the homotopy set of…

Category Theory · Mathematics 2014-10-27 Katsuhiko Kuribayashi

We show that the isomorphism class of a two-step solvable Lie poset subalgebra of a semisimple Lie algebra is determined by its dimension. We further establish that all such algebras are absolutely rigid.

Rings and Algebras · Mathematics 2020-04-02 Vincent Coll , Nicholas Mayers , Nicholas Russoniello

Motivated by some known problems concerning combinatorial structures associated with finite one-dimensional affine permutation groups, we study subgroups which are closed in $\operatorname{\Gamma{L}}_1(q)$. This brings us to a description…

Group Theory · Mathematics 2026-03-26 Alexander Buturlakin , Andrey V. Vasil'ev

Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear…

Quantum Physics · Physics 2013-05-29 Marcin Wiesniak , Marcin Markiewicz

We give a definition of associative schemes, schemes of associative rings, over a field $k,$ using the definition of completion of an associative $k$-algebra in a finite set of simple modules. We start by giving a weaker but sufficient…

Algebraic Geometry · Mathematics 2024-10-24 Arvid Siqveland

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

Combinatorics · Mathematics 2019-10-08 Jane Tan