Hall Polynomials and Composition Algebra of Representation Finite Algebras

Let \(\mathcal{A}\) be a representation finite algebra over finite field k such that the indecomposable \(\mathcal{A}\) -modules are determined by their dimension vectors and for each \(M, L \in ind(\mathcal{A})\) and \(N\in mod(\mathcal{A})\) , either \(F^{M}_{N L}=0\) or \(F^{M}_{L N}=0\) . We show that \(\mathcal{A}\) has Hall polynomials and the rational extension of its Ringel–Hall algebra equals the rational extension of its composition algebra. This result extend and unify some known results about Hall polynomials. As a consequence we show that if \(\mathcal{A}\) is a representation finite simply-connected algebra, or finite dimensional k-algebra such that there are no short cycles in \(mod(\mathcal{A})\) , or representation finite cluster tilted algebra, then \(\mathcal{A}\) has Hall polynomials and \(\mathcal{H}(\mathcal{A})\otimes_\mathbb{Z}Q=\mathcal{C}(\mathcal{A})\otimes_\mathbb{Z}Q\) .     

Some totally geodesic submanifolds of the nonlinear Grassmannian of a compact symmetric space

Let \(M\) and \(N\) be two connected smooth manifolds, where \(M\) is compact and oriented and \(N\) is Riemannian. Let \(\mathcal {E}\) be the Fréchet manifold of all embeddings of \(M\) in \(N\) , endowed with the canonical weak Riemannian metric. Let \(\sim \) be the equivalence relation on \(\mathcal {E}\) defined by \(f\sim g\) if and only if \(f=g\circ \phi \) for some orientation preserving diffeomorphism \(\phi \) of \(M\) . The Fréchet manifold \(\mathcal {S}= \mathcal {E}/_{\sim }\) of equivalence classes, which may be thought of as the set of submanifolds of \(N\) diffeomorphic to \(M\) and is called the nonlinear Grassmannian (or Chow manifold) of \(N\) of type \(M\) , inherits from \( \mathcal {E}\) a weak Riemannian structure. We consider the following particular case: \(N\) is a compact irreducible symmetric space and \(M\) is a reflective submanifold of \(N\) (that is, a connected component of the set of fixed points of an involutive isometry of \( N\) ). Let \(\mathcal {C}\) be the set of submanifolds of \(N\) which are congruent to \(M\) . We prove that the natural inclusion of \(\mathcal {C}\) in \(\mathcal {S}\) is totally geodesic.     

\mathcal {A}_{p, {\mathbb {E}}} Weights,Maximal Operators,and Hardy Spaces Associated with a Family of General Sets

Suppose that \({\mathbb {E}}:=\{E_r(x)\}_{r\in {\mathcal {I}}, x\in X}\) is a family of open subsets of a topological space \(X\) endowed with a nonnegative Borel measure \(\mu \) satisfying certain basic conditions. We establish an \(\mathcal {A}_{{\mathbb {E}}, p}\) weights theory with respect to \({\mathbb {E}}\) and get the characterization of weighted weak type (1,1) and strong type \((p,p)\) , \(1<p\le \infty \) , for the maximal operator \({\mathcal {M}}_{{\mathbb {E}}}\) associated with \({\mathbb {E}}\) . As applications, we introduce the weighted atomic Hardy space \(H^1_{{\mathbb {E}}, w}\) and its dual \(BMO_{{\mathbb {E}},w}\) , and give a maximal function characterization of \(H^1_{{\mathbb {E}},w}\) . Our results generalize several well-known results.     

Measure of Self-Affine Sets and Associated Densities

Let \(B\) be an \(n\times n\) real expanding matrix and \(\mathcal {D}\) be a finite subset of \(\mathbb {R}^n\) with \(0\in \mathcal {D}\) . The self-affine set \(K=K(B,\mathcal {D})\) is the unique compact set satisfying the set-valued equation \(BK=\bigcup _{d\in \mathcal {D}}(K+d)\) . In the case where \(\#\mathcal D=|\det B|,\) we relate the Lebesgue measure of \(K(B,\mathcal {D})\) to the upper Beurling density of the associated measure \(\mu =\lim _{s\rightarrow \infty }\sum _{\ell _0, \ldots ,\ell _{s-1}\in \mathcal {D}}\delta _{\ell _0+B\ell _1+\cdots +B^{s-1}\ell _{s-1}}.\) If, on the other hand, \(\#\mathcal D<|\det B|\) and \(B\) is a similarity matrix, we relate the Hausdorff measure \(\mathcal {H}^s(K)\) , where \(s\) is the similarity dimension of \(K\) , to a corresponding notion of upper density for the measure \(\mu \) .     

Approximate Unitary Equivalence to Skew Symmetric Operators

An operator \(T\) on a complex Hilbert space \(\mathcal {H}\) is called skew symmetric if \(T\) can be represented as a skew symmetric matrix relative to some orthonormal basis for \(\mathcal {H}\) . In this paper, we study the approximation of skew symmetric operators and provide a \(C^*\) -algebra approach to skew symmetric operators. We classify up to approximate unitary equivalence those skew symmetric operators \(T\in \mathcal {B(H)}\) satisfying \(C^*(T)\cap \mathcal {K(H)}=\{0\}\) . This is used to characterize when a unilateral weighted shift with nonzero weights is approximately unitarily equivalent to a skew symmetric operator.     

Classical limit of the tensor product of holomorphic discrete series representations

For three coadjoint orbits \(\mathcal {O}_1, \mathcal {O}_2\) and \(\mathcal {O}_3\) in \(\mathfrak {g}^*\) , the Corwin–Greenleaf function \(n(\mathcal {O}_1 \times \mathcal {O}_2, \mathcal {O}_3)\) is given by the number of \(G\) -orbits in \(\{(\lambda , \mu ) \in \mathcal {O}_1 \times \mathcal {O}_2 \, : \, \lambda + \mu \in \mathcal {O}_3 \}\) under the diagonal action. In the case where \(G\) is a simple Lie group of Hermitian type, we give an explicit formula of \(n(\mathcal {O}_1 \times \mathcal {O}_2, \mathcal {O}_3)\) for coadjoint orbits \(\mathcal {O}_1\) and \(\mathcal {O}_2\) that meet \(\left( [\mathfrak {k}, \mathfrak {k}] + \mathfrak {p}\right) ^{\perp }\) , and show that the formula is regarded as the ‘classical limit’ of a special case of Kobayashi’s multiplicity-free theorem (Progr. Math. 2007) in the branching law to symmetric pairs.     

On Graphlike k-Dissimilarity Vectors

Let \({\mathcal{G} = (G, w)}\) be a positive-weighted simple finite connected graph, that is, let G be a simple finite connected graph endowed with a function w from the set of edges of G to the set of positive real numbers. For any subgraph \({G^\prime}\) of G, we define \({w(G^\prime)}\) to be the sum of the weights of the edges of \({G^\prime}\) . For any i ₁, . . . , i _k vertices of G, let \({D_{\{i_1,..., i_k\}} (\mathcal{G})}\) be the minimum of the weights of the subgraphs of G connecting i ₁, . . . , i _k . The \({D_{\{i_1,..., i_k\}}(\mathcal{G})}\) are called k-weights of \({\mathcal{G}}\) . Given a family of positive real numbers parametrized by the k-subsets of {1, . . . , n}, \({{\{D_I\}_{I} \in { \{1,...,n\} \choose k}}}\) , we can wonder when there exist a weighted graph \({\mathcal{G}}\) (or a weighted tree) and an n-subset {1, . . . , n} of the set of its vertices such that \({D_I (\mathcal{G}) = D_I}\) for any \({I} \in { \{1,...,n\} \choose k}\) . In this paper we study this problem in the case k =  n?1.     

Descent in Locally Presentable Categories

Let \(\mathbb {V}=(VV, \otimes , I)\) be a symmetric monoidal category such that \(\mathcal {V}\) is locally presentable and that all functors \(V\otimes - : \mathcal {V} \rightarrow \mathcal {V}\) for \(V \in \mathcal {V}\) preserve reflexive coequalizers and directed colimits. It is proved that any pure morphism of commutative ??-monoids is an effective descent morphism with respect to the indexed category given by commutative ??-monoids and modules over them. As a by-product, we prove that pure morphisms in a locally presentable category are effective for codescent.     

Anderson’s Orthogonality Catastrophe for One-Dimensional Systems

The overlap, \({\mathcal{D}_N}\) , between the ground state of N free fermions and the ground state of N fermions in an external potential in one spatial dimension is given by a generalized Gram determinant. An upper bound is \({\mathcal{D}_N\leq\exp(-\mathcal{I}_N)}\) with the so-called Anderson integral \({\mathcal{I}_N}\) . We prove, provided the external potential satisfies some conditions, that in the thermodynamic limit \({\mathcal{I}_N = \gamma\ln N + O(1)}\) as \({N\to\infty}\) . The coefficient γ > 0 is given in terms of the transmission coefficient of the one-particle scattering matrix. We obtain a similar lower bound on \({\mathcal{D}_N}\) concluding that \({\tilde{C} N^{-\tilde{\gamma}} \leq \mathcal{D}_N \leq CN^{-\gamma}}\) with constants C, \({\tilde{C}}\) , and \({\tilde{\gamma}}\) . In particular, \({\mathcal{D}_N\to 0}\) as \({N\to\infty}\) which is known as Anderson’s orthogonality catastrophe.     

Erdős-Ginzburg-Ziv theorem for finite commutative semigroups

Let \(\mathcal{S}\) be a finite additively written commutative semigroup, and let \(\exp(\mathcal{S})\) be its exponent which is defined as the least common multiple of all periods of the elements in \(\mathcal{S}\) . For every sequence T of elements in \(\mathcal{S}\) (repetition allowed), let \(\sigma(T) \in\mathcal{S}\) denote the sum of all terms of T. Define the Davenport constant \(\mathsf{D}(\mathcal{S})\) of \(\mathcal{S}\) to be the least positive integer d such that every sequence T over \(\mathcal{S}\) of length at least d contains a proper subsequence T′ with σ(T′)=σ(T), and define \(\mathsf{E}(\mathcal{S})\) to be the least positive integer ? such that every sequence T over \(\mathcal{S}\) of length at least ? contains a subsequence T′ with \(|T|-|T'|= \lceil\frac{|\mathcal{S}|}{\exp(\mathcal{S})} \rceil \exp(\mathcal{S})\) and σ(T′)=σ(T). When \(\mathcal{S}\) is a finite abelian group, it is well known that \(\lceil\frac{|\mathcal{S}|}{\exp(\mathcal{S})} \rceil\exp (\mathcal{S})=|\mathcal{S}|\) and \(\mathsf{E}(\mathcal{S})=\mathsf{D}(\mathcal{S})+|\mathcal{S}|-1\) . In this paper we investigate whether \(\mathsf{E}(\mathcal{S})\leq \mathsf{D}(\mathcal{S})+ \lceil\frac{|\mathcal{S}|}{\exp(\mathcal {S})} \rceil \exp(\mathcal{S})-1\) holds true for all finite commutative semigroups \(\mathcal{S}\) . We provide a positive answer to the question above for some classes of finite commutative semigroups, including group-free semigroups, elementary semigroups, and archimedean semigroups with certain constraints.     

Neighbour-transitive codes in Johnson graphs

The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains.     

On the Dirichlet and Neumann Evolution Operators in ℝ d +

We prove some uniform and pointwise gradient estimates for the Dirichlet and the Neumann evolution operators \(G_{\mathcal {D}}(t,s)\) and \(G_{\mathcal {N}}(t,s)\) associated with a class of nonautonomous elliptic operators (t) with unbounded coefficients defined in I× \(\mathbb{R}_{+}\) (where I is a right-halfline or I=?). We also prove the existence and the uniqueness of a tight evolution system of measures \(\left \{\mu _{t}^{\mathcal {N}}\right \}_{t \in I}\) associated with \(G_{\mathcal {N}}(t,s)\) , which turns out to be sub-invariant for \(G_{\mathcal {D}}(t,s)\) , and we study the asymptotic behaviour of the evolution operators \(G_{\mathcal {D}}(t,s)\) and \(G_{\mathcal {N}}(t,s)\) in the L ^p -spaces related to the system \(\left \{\mu _{t}^{\mathcal {N}}\right \}_{t \in I}\) .     

From submodule categories to preprojective algebras

Let \(S(n)\) be the category of invariant subspaces of nilpotent operators with nilpotency index at most \(n\) . Such submodule categories have been studied already in 1934 by Birkhoff, they have attracted a lot of attention in recent years, for example in connection with some weighted projective lines (Kussin, Lenzing, Meltzer). On the other hand, we consider the preprojective algebra \(\Pi _n\) of type \(\mathbb {A}_n\) ; the preprojective algebras were introduced by Gelfand and Ponomarev, they are now of great interest, for example they form an important tool to study quantum groups (Lusztig) or cluster algebras (Geiss, Leclerc, Schröer). We are going to discuss the connection between the submodule category \(\mathcal {S}(n)\) and the module category \(\hbox {mod}\;\Pi _{n-1}\) of the preprojective algebra \(\Pi _{n-1}\) . Dense functors \(\mathcal {S}(n) \rightarrow \hbox {mod}\;\Pi _{n-1}\) are known to exist: one has been constructed quite a long time ago by Auslander and Reiten, recently another one by Li and Zhang. We will show that these two functors are full, dense, objective functors with index \(2n\) , thus \(\hbox {mod}\;\Pi _{n-1}\) is obtained from \(\mathcal {S}(n)\) by factoring out an ideal which is generated by \(2n\) indecomposable objects. As a byproduct we also obtain new examples of ideals in triangulated categories, namely ideals \(\mathcal {I}\) in a triangulated category \(\mathcal {T}\) which are generated by an idempotent such that the factor category \(\mathcal {T}/\mathcal {I}\) is an abelian category.     

Divide and Conquer Roadmap for Algebraic Sets

Let \(\mathrm{R}\) be a real closed field and \(\hbox {D}\subset \mathrm{R}\) an ordered domain. We describe an algorithm that given as input a polynomial \(P \in \hbox {D}[ X_{1} , \ldots ,X_{{ k}} ]\) and a finite set, \(\mathcal {A}= \{ p_{1} , \ldots ,p_{m} \}\) , of points contained in \(V= {\mathrm{{Zer}}} ( P, \mathrm{R}^{{ k}})\) described by real univariate representations, computes a roadmap of \(V\) containing \(\mathcal {A}\) . The complexity of the algorithm, measured by the number of arithmetic operations in \(\hbox {D}\) , is bounded by \(\big ( \sum _{i=1}^{m} D^{O ( \log ^{2} ( k ) )}_{i} +1 \big ) ( k^{\log ( k )} d )^{O ( k\log ^{2} ( k ))}\) , where \(d= \deg ( P )\) and \(D_{i}\) is the degree of the real univariate representation describing the point \(p_{i}\) . The best previous algorithm for this problem had complexity card \(( \mathcal {A} )^{O ( 1 )} d^{O ( k^{3/2} )}\) (Basu et al., ArXiv, 2012), where it is assumed that the degrees of the polynomials appearing in the representations of the points in \(\mathcal {A}\) are bounded by \(d^{O ( k )}\) . As an application of our result we prove that for any real algebraic subset \(V\) of \(\mathbb {R}^{k}\) defined by a polynomial of degree \(d\) , any connected component \(C\) of \(V\) contained in the unit ball, and any two points of \(C\) , there exists a semi-algebraic path connecting them in \(C\) , of length at most \(( k ^{\log (k )} d )^{O ( k\log ( k ) )}\) , consisting of at most \(( k ^{\log (k )} d )^{O ( k\log ( k ) )}\) curve segments of degrees bounded by \(( k ^{\log ( k )} d )^{O ( k \log ( k) )}\) . While it was known previously, by a result of D’Acunto and Kurdyka (Bull Lond Math Soc 38(6):951–965, 2006), that there always exists a path of length \(( O ( d ) )^{k-1}\) connecting two such points, there was no upper bound on the complexity of such a path.     

Distributions and the Global Operator of Slice Monogenic Functions

In this paper we consider functions \(f\) defined on an open set \(U\) of the Euclidean space \(\mathbb{R }^{n+1}\) and with values in the Clifford Algebra \(\mathbb{R }_n\) . Slice monogenic functions \(f: U \subseteq \mathbb{R }^{n+1} \rightarrow \mathbb{R }_n\) belong to the kernel of the global differential operator with non constant coefficients given by \( \mathcal{G }=|{\underline{x}}|^2\frac{\partial }{\partial x_0} \ + \ {\underline{x}} \ \sum _{j=1}^n x_j\frac{\partial }{\partial x_j}. \) Since the operator \(\mathcal{G }\) is not elliptic and there is a degeneracy in \( {\underline{x}}=0\) , its kernel contains also less smooth functions that have to be interpreted as distributions. We study the distributional solutions of the differential equation \(\mathcal{G }F(x_0,{\underline{x}})=G(x_0,{\underline{x}})\) and some of its variations. In particular, we focus our attention on the solutions of the differential equation \( ({\underline{x}}\frac{\partial }{\partial x_0} \ - E)F(x_0,{\underline{x}})=G(x_0,{\underline{x}}), \) where \(E= \sum _{j=1}^n x_j\frac{\partial }{\partial x_j}\) is the Euler operator, from which we deduce properties of the solutions of the equation \( \mathcal{G }F(x_0,{\underline{x}})=G(x_0,{\underline{x}})\) .     

On the Relaxed Colouring Game and the Unilateral Colouring Game

In the paper we introduce the new game—the unilateral \({\mathcal{P}}\) -colouring game which can be used as a tool to study the r-colouring game and the (r, d)-relaxed colouring game. Let be given a graph G, an additive hereditary property \({\mathcal {P}}\) and a set C of r colours. In the unilateral \({\mathcal {P}}\) -colouring game similarly as in the r-colouring game, two players, Alice and Bob, colour the uncoloured vertices of the graph G, but in the unilateral \({\mathcal {P}}\) -colouring game Bob is more powerful than Alice. Alice starts the game, the players play alternately, but Bob can miss his move. Bob can colour the vertex with an arbitrary colour from C, while Alice must colour the vertex with a colour from C in such a way that she cannot create a monochromatic minimal forbidden subgraph for the property \({\mathcal {P}}\) . If after |V(G)| moves the graph G is coloured, then Alice wins the game, otherwise Bob wins. The \({\mathcal {P}}\) -unilateral game chromatic number, denoted by \({\chi_{ug}^\mathcal {P}(G)}\) , is the least number r for which Alice has a winning strategy for the unilateral \({\mathcal {P}}\) -colouring game with r colours on G. We prove that the \({\mathcal {P}}\) -unilateral game chromatic number is monotone and is the upper bound for the game chromatic number and the relaxed game chromatic number. We give the winning strategy for Alice to play the unilateral \({\mathcal {P}}\) -colouring game. Moreover, for k ≥  2 we define a class of graphs \({\mathcal {H}_k =\{G|{\rm every \;block \;of\;}G \; {\rm has \;at \;most}\; k \;{\rm vertices}\}}\) . The class \({\mathcal {H}_k }\) contains, e.g., forests, Husimi trees, line graphs of forests, cactus graphs. Let \({\mathcal {S}_d}\) be the class of graphs with maximum degree at most d. We find the upper bound for the \({\mathcal {S}_2}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_3}\) and we study the \({\mathcal {S}_d}\) -unilateral game chromatic number for graphs from \({\mathcal {H}_4}\) for \({d \in \{2,3\}}\) . As the conclusion from these results we obtain the result for the d-relaxed game chromatic number: if \({G \in \mathcal {H}_k}\) , then \({\chi_g^{(d)}(G) \leq k + 2-d}\) , for \({k \in \{3, 4\}}\) and \({d \in \{0, \ldots, k-1\}}\) . This generalizes a known result for trees.     

Solid Extensions of the Cesàro Operator on ℓ p and c 0

We introduce and study the largest Banach lattice (for the coordinate-wise order) which is a solid subspace of \({\mathbb{C}^\mathbb{N}}\) and to which the classical Cesàro operator \({\mathcal{C}\colon\ell^p \to \ell^p}\) (a positive operator) can be continuously extended while still maintaining its values in ? ^p . Properties of this optimal Banach lattice \({[\mathcal{C}, \ell^p]_s}\) are presented. In addition, all continuous convolution operators of \({[\mathcal{C}, \ell^p]_s}\) into itself are identified and the spectrum of \({\mathcal{C}\colon[\mathcal{C}, \ell^p]_s \to[\mathcal{C}, \ell^p]_s}\) is determined. A similar investigation is undertaken for the Cesàro operator \({\mathcal{C}\colon c_0\to c_0}\) .     

Approximating minimum-cost edge-covers of crossing biset-families

Part of this paper appeared in the preliminary version [16]. An ordered pair ? = (S, S ₊) of subsets of a groundset V is called a biset if S ? S+; (V S ⁺;V S) is the co-biset of ?. Two bisets \(\hat X,\hat Y\) intersect if ^X X ∩ Y ≠ \(\not 0\) and cross if both X ∩ Y \(\not 0\) and X ⁺ ∪ Y ⁺ ≠= V. The intersection and the union of two bisets \(\hat X,\hat Y\) are defined by \(\hat X \cap \hat Y = (X \cap Y,X^ + \cap Y^ + )\) and \(\hat X \cup \hat Y = (X \cup Y,X^ + \cup Y^ + )\) . A biset-family \(\mathcal{F}\) is crossing (intersecting) if \(\hat X \cap \hat Y,\hat X \cup \hat Y \in \mathcal{F}\) for any \(\hat X,\hat Y \in \mathcal{F}\) that cross (intersect). A directed edge covers a biset ? if it goes from S to V S ⁺. We consider the problem of covering a crossing biset-family \(\mathcal{F}\) by a minimum-cost set of directed edges. While for intersecting \(\mathcal{F}\) , a standard primal-dual algorithm computes an optimal solution, the approximability of the case of crossing \(\mathcal{F}\) is not yet understood, as it includes several NP-hard problems, for which a poly-logarithmic approximation was discovered only recently or is not known. Let us say that a biset-family \(\mathcal{F}\) is k-regular if \(\hat X \cap \hat Y,\hat X \cup \hat Y \in \mathcal{F}\) for any \(\hat X,\hat Y \in \mathcal{F}\) with |V (X∪Y)≥k+1 that intersect. In this paper we obtain an O(log |V|)-approximation algorithm for arbitrary crossing \(\mathcal{F}\) if in addition both \(\mathcal{F}\) and the family of co-bisets of \(\mathcal{F}\) are k-regular, our ratios are: \(O\left( {\log \frac{{|V|}} {{|V| - k}}} \right) \) if |S ⁺ \ S| = k for all \(\hat S \in \mathcal{F}\) , and \(O\left( {\frac{{|V|}} {{|V| - k}}\log \frac{{|V|}} {{|V| - k}}} \right) \) if |S ⁺ \ S| = k for all \(\hat S \in \mathcal{F}\) . Using these generic algorithms, we derive for some network design problems the following approximation ratios: \(O\left( {\log k \cdot \log \tfrac{n} {{n - k}}} \right) \) for k-Connected Subgraph, and O(logk) \(\min \{ \tfrac{n} {{n - k}}\log \tfrac{n} {{n - k}},\log k\} \) for Subset k-Connected Subgraph when all edges with positive cost have their endnodes in the subset.     

Note on Group Distance Magic Graphs G[C 4]

A group distance magic labeling or a ${\mathcal{G}}$ -distance magic labeling of a graph G =  (V, E) with ${|V | = n}$ is a bijection f from V to an Abelian group ${\mathcal{G}}$ 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 element ${\mu \in \mathcal{G}}$ , called the magic constant. In this paper we will show that if G is a graph of order n =  2 ^p (2k + 1) for some natural numbers p, k such that ${\deg(v)\equiv c \mod {2^{p+1}}}$ for some constant c for any ${v \in V(G)}$ , then there exists a ${\mathcal{G}}$ -distance magic labeling for any Abelian group ${\mathcal{G}}$ of order 4n for the composition G[C ₄]. Moreover we prove that if ${\mathcal{G}}$ is an arbitrary Abelian group of order 4n such that ${\mathcal{G} \cong \mathbb{Z}_2 \times\mathbb{Z}_2 \times \mathcal{A}}$ for some Abelian group ${\mathcal{A}}$ of order n, then there exists a ${\mathcal{G}}$ -distance magic labeling for any graph G[C ₄], where G is a graph of order n and n is an arbitrary natural number.     

Completely regular clique graphs

Let Γ=(X,R) be a connected graph. Then Γ is said to be a completely regular clique graph of parameters (s,c) with s≥1 and c≥1, if there is a collection \(\mathcal{C}\) of completely regular cliques of size s+1 such that every edge is contained in exactly c members of  \(\mathcal{C}\) . In this paper, we show that the parameters of \(C\in\mathcal{C}\) as a completely regular code do not depend on \(C\in\mathcal{C}\) . As a by-product we have that all completely regular clique graphs are distance-regular whenever \(\mathcal {C}\) consists of edges. We investigate the case when Γ is distance-regular, and show that Γ is a completely regular clique graph if and only if it is a bipartite half of a distance-semiregular graph.