Related papers: The structure of $3$-pyramidal groups
The Poisson structures for 3D systems possessing one constant of motion can always be constructed from the solution of a linear PDE. When two constants of the motion are available the problem reduces to a quadrature and the structure…
Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…
In this paper, we investigate groupoids coming from configurations of lines in three-dimensional space. Given a point and two skew lines in $\mathbb{P}^{3}_{K}$ over a field $K$, there exists a unique line containing the given point and…
We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a…
For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we show that if the diameter of $\Delta(G)$ is equal to three, then the complement…
A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…
Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
A combinatorial model of molecular conformational space that was previously developped (J. Gabarro-Arpa, Comp. Biol. and Chem. 27, (2003) 153-159), had the drawback that structures could not be properly embedded beacause it lacked explicit…
Textures are topologically nontrivial field configurations which can exist in a field theory in which a global symmetry group $G$ is broken to a subgroup $H$, if the third homotopy group $\p3$ of $G/H$ is nontrivial. We compute this group…
A group in which every element commutes with its endomorphic images is called an $E$-group. Our main result is that all 3-generator $E$-groups are abelian. It follows that the minimal number of generators of a finitely generated non-abelian…
We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…
Consider the diagonal action of the projective group $\PGL_3$ on $n$ copies of ${\mathbb P}^2$. In addition, consider the action of the symmetric group $\Sigma_n$ by permuting the copies. In this paper we find a set of generators for the…
Let R_{n,d} be the ring of invariants of d-tuples of n x n matrices under the simultaneous conjugation action of the general linear group. A minimal generating system and a homogeneous system of parameters for R_{3,3} are determined.…
We determine the structure of the finite non-solvable groups of order divisible by $3$ all whose maximal subgroups of order divisible by $3$ are supersolvable. Precisely, we demonstrate that if $G$ is a finite non-solvable group satisfying…
An answer to the question investigated in this paper brings a new characterization of internal groupoids such that: (a) it holds even when finite limits are not assumed to exist; (b) it is a full subcategory of the category of…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…