اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA magic rectangle set on Abelian groups
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A $Gamma$-magic rectangle set $MRS_{Gamma}(a, b; c)$ of order $abc$ is a collection of $c$ arrays $(atimes b)$ whose entries are elements of group $Gamma$, each appearing once, with all row sums in every rectangle equal to a constant $omegain Gamma$ and all column sums in every rectangle equal to a constant $delta in Gamma$. In this paper we prove that for ${a,b} eq{2^{alpha},2k+1}$ where $alpha$ and $k$ are some natural numbers, a $Gamma$-magic rectangle set MRS$_{Gamma}(a, b;c)$ exists if and only if $a$ and $b$ are both even or and $|Gamma|$ is odd or $Gamma$ has more than one involution. Moreover we obtain sufficient and necessary conditions for existence a $Gamma$-magic rectangle MRS$_{Gamma}(a, b)$=MRS$_{Gamma}(a, b;1)$.
قيم البحث
اقرأ أيضاً
A finite group $G$ is called a Schur group, if any Schur ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. Recently, the authors have completely identified the cyclic Schur groups. In this
paper it is shown that any abelian Schur group belongs to one of several explicitly given families only. In particular, any non-cyclic abelian Schur group of odd order is isomorphic to $Z_3times Z_{3^k}$ or $Z_3times Z_3times Z_p$ where $kge 1$ and $p$ is a prime. In addition, we prove that $Z_2times Z_2times Z_p$ is a Schur group for every prime $p$.
We present two sets of 12 integers that have the same sets of 4-sums. The proof of the fact that a set of 12 numbers is uniquely determined by the set of its 4-sums published 50 years ago is wrong, and we demonstrate an incorrect calculation in it.
We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of Fq[T] of degree d for which s consecutive coefficients a_{d-1},..., a_{d-s} are fixed. Our estimate holds without restrictions on the characterist
ic of Fq and asserts that V(d,s,bfs{a})=mu_d.q+mathcal{O}(1), where V(d,s,bfs{a}) is such an average cardinality, mu_d:=sum_{r=1}^d{(-1)^{r-1}}/{r!} and bfs{a}:=(a_{d-1},.., d_{d-s}). We provide an explicit upper bound for the constant underlying the mathcal{O}--notation in terms of d and s with good behavior. Our approach reduces the question to estimate the number of Fq--rational points with pairwise--distinct coordinates of a certain family of complete intersections defined over Fq. We show that the polynomials defining such complete intersections are invariant under the action of the symmetric group of permutations of the coordinates. This allows us to obtain critical information concerning the singular locus of the varieties under consideration, from which a suitable estimate on the number of Fq--rational points is established.
A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations and reflecti
ons of the square. Under these transformations, there are 21 types of magic SET squares. We calculate the number of squares of each type. In addition, we discuss a game of SET tic-tac-toe.
Using a theorem of Frobenius filtered through partition generating function techniques, we prove partition-theoretic and $q$-series Abelian theorems, yielding analogues of Abels convergence theorem for complex power series, and related formulas. As a
n application we give a limiting formula for the $q$-bracket of Bloch and Okounkov, an operator from statistical physics connected to the theory of modular forms, as $qto 1$ from within the unit disk.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
