A Combinatorial Problem on Abelian Groups
From MaRDI portal
Publication:5812241
DOI10.2307/2032592zbMath0047.02701OpenAlexW4242877767MaRDI QIDQ5812241
Publication date: 1952
Full work available at URL: https://doi.org/10.2307/2032592
Related Items (39)
The number of distinct symbols in sections of rectangular arrays ⋮ Transversals, near transversals, and diagonals in iterated groups and quasigroups ⋮ Completing partial transversals of Cayley tables of Abelian groups ⋮ Complementary permutations for abelian groups ⋮ Transversals in long rectangular arrays ⋮ Mirror theory and cryptography ⋮ Delay colourings of cubic graphs ⋮ Fredman's reciprocity, invariants of Abelian groups, and the permanent of the Cayley table. ⋮ Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem ⋮ From \(r\)-linearized polynomial equations to \(r^m\)-linearized polynomial equations ⋮ Протоколы дистанционного голосования. I;Remote voting protocols. I ⋮ Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets ⋮ All group‐based latin squares possess near transversals ⋮ Unnamed Item ⋮ On some batch code properties of the simplex code ⋮ Differences of Bijections ⋮ Разностные спецификации подстановок и разбиения в кольце вычетов ⋮ On some properties of PRNGs based on block ciphers in counter mode ⋮ On a permutation problem for finite abelian groups ⋮ On the permanents of circulant and degenerate Schur matrices ⋮ Exterior algebras and two conjectures on finite Abelian groups. ⋮ A generalization of plexes of Latin squares ⋮ The number of terms in the permanent and the determinant of a generic circulant matrix ⋮ A number-theoretic function related to Latin squares ⋮ Circulant matrices and mathematical juggling ⋮ On a generalization of the seating couples problem ⋮ On the generalized Oberwolfach problem ⋮ The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of abelian groups ⋮ The “Coefficients H” Technique ⋮ Signed Langford sequences ⋮ A polynomial-time algorithm for finding zero-sums. ⋮ Perpendicular rectangular Latin arrays ⋮ Delay colouring in quartic graphs ⋮ A Proof of Security in O(2 n ) for the Xor of Two Random Permutations ⋮ On various restricted sumsets ⋮ Enumerations for Permutations in Difference Form ⋮ \(\phi\)-symmetric Hamilton cycle decompositions of graphs ⋮ Reconstructing permutation matrices from diagonal sums ⋮ On some graph-cordial abelian groups
This page was built for publication: A Combinatorial Problem on Abelian Groups
