相关论文: Hamming sandwiches

Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…

We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…

An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…

We show that every continuous homogeneous quasimorphism on a finite-dimensional 1-connected simple Lie group arises as the relative growth of any continuous bi-invariant partial order on that group. More generally we show, that an arbitrary…

Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations, including cometric Q-antipodal association schemes. After a review of imprimitivity, we show that an imprimitive association…

An association scheme is called quasi-thin if the valency of each its basic relation is one or two. A quasi-thin scheme is Kleinian if the thin residue of it forms a Klein group with respect to the relation product. It is proved that any…

We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…

We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…

We complete characterization of bijections preserving commutators (PC-maps) in the group of unitriangular matrices $UT(n,F)$ over a field $F$, where $n$ is a natural number or infinity. PC-maps were recently described up to almost identity…

We are interested in semigroups of the form $\langle G,a\rangle\setminus G$, where $G$ is a permutation group of degree $n$ and $a$ a non-permutation on the domain of $G$. A theorem of the first author, Mitchell and Schneider shows that, if…

In this article we determine feasible parameter sets for (what could potentially be) commutative association schemes with noncyclotomic eigenvalues that are of smallest possible rank and order. A feasible parameter set for a commutative…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

We investigate charge-parity (CP) and non-CP outer automorphism of groups and the transformation behavior of group representations under them. We identify situations where composite and elementary states that transform in exactly the same…

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…

Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…

In this paper we show that for any fusion $\mathcal{B}$ of an association scheme $\mathcal{A}$, the generalized Hamming scheme $H(n,\mathcal{B})$ is a nontrivial fusion of $H(n,\mathcal{A})$. We analyze the case where $\mathcal{A}$ is the…

We introduce the concept of Almost-Companion Matrix (ACM) by relaxing the non-derogatory property of the standard Companion Matrix (CM). That is, we define an ACM as a matrix whose characteristic polynomial coincides with a given monic and…

Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…