相关论文: Note on a magic rectangle set on dihedral group

It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…

We report recent progress in the problem of distinguishing convex subsets of cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. It turns out that for any of these model sets $\varLambda$…

A proper Euler's magic matrix is an integer $n\times n$ matrix $M\in\mathbb Z^{n\times n}$ such that $M\cdot M^t=\gamma\cdot I$ for some nonzero constant $\gamma$, the sum of the squares of the entries along each of the two main diagonals…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

For each natural number $n$, we consider the subgroup $\mathcal{R}_n$ of Homeo$_+[0,1]$ made by the elements that are linear except for a subset whose Cantor-Bendixson rank is less than or equal to $n$. These groups of generalized…

Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…

The goal of this article is to construct explicitly a p-adic family of representations (which are dihedral representations), to construct their associated (phi,Gamma)-modules by writing down explicit matrices for phi and for the action of…

Let $G$ be a graph of order $n$ and $N = \{N(u_{i})\}^k_{i=1}$ be a sequence of neighbourhood(nbh)s in $G$ where $N(u)$ = $\{v\in V(G):$ $uv\in E(G)\}$. \emph{Nbh sequence graph $H$ of} $N$ in $G$ is defined as the union of all induced…

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same…

A group $G$ admits an \textbf{\em $n$-partite digraphical representation} if there exists a regular $n$-partite digraph $\Gamma$ such that the automorphism group $\mathrm{Aut}(\Gamma)$ of $\Gamma$ satisfies the following properties:…

We perform a systematic study of dihedral groups used as flavor symmetry. The key feature here is the fact that we do not allow the dihedral groups to be broken in an arbitrary way, but in all cases some (non-trivial) subgroup has to be…

We prove a bijective unitary correspondence between 1) the isospectral torus of almost-periodic, absolutely continuous CMV matrices having fixed finite-gap spectrum and 2) special periodic block-CMV matrices satisfying a Magic Formula. This…

Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…

In this paper we complete the classification of topological symmetry groups for complete graphs $K_n$ by characterizing which $K_n$ can have a cyclic group, a dihedral group, or a subgroup of $D_m \times D_m$ where $m$ is odd, as its…

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

Let $\Gamma$ be a crystallographic group of dimension $n,$ i.e. a discrete, cocompact subgroup of $\operatorname{Isom}(\mathbb{R}^n)$ = $O(n)\ltimes\mathbb{R}^n.$ For any $n\geq 2,$ we construct a crystallographic group with a trivial…

Given two integers $m$ and $n$ with $m\leq n$, a Latin rectangle of size $m\times n$ is a bi-dimensional array with $m$ rows and $n$ columns filled with symbols from an alphabet with $n$ symbols, such that each row contains a permutation of…

A $(p,q,r)$-board that has $pq+pr+qr$ squares consists of a $(p,q)$-, a $(p,r)$-, and a $(q,r)$-rectangle. Let $S$ be the set of the squares. Consider a bijection $f : S \to [1,pq+pr+qr]$. Firstly, for $1 \le i \le p$, let $x_i$ be the sum…

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

The Dinitz conjecture states that, for each $n$ and for every collection of $n$-element sets $S_{ij}$, an $n\times n$ partial latin square can be found with the $(i,j)$\<th entry taken from $S_{ij}$. The analogous statement for $(n-1)\times…