Results 11 to 20 of about 911,714 (247)
Multiple transitivity except for a system of imprimitivity [PDF]
Journal of Group Theory, vol. 27, no. 4, 2024, pp. 651-712., 2022 Let $\Omega$ be a set equipped with an equivalence relation $\sim$; we refer to the equivalence classes as blocks of $\Omega$. A permutation group $G \le \mathrm{Sym}(\Omega)$ is $k$-by-block-transitive if $\sim$ is $G$-invariant, with at least $k$ blocks, and $G$ is transitive on the set of $k$-tuples of points such that no two entries lie in the same
arxiv +1 more source
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes [PDF]
IEEE Transactions on Information Theory, 2007 We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the tradeoff between performance and complexity of iterative decoding for the binary erasure channel.
T. Hehn +3 more
semanticscholar +1 more source
Imprimitively generated designs [PDF]
, 2022 2022 Summer.Includes bibliographical references.Designs are a type of combinatorial object which uniformly cover all pairs in a base set V with subsets of V known as blocks.
Lear, Aaron
core
Block Sensitivity of Minterm-Transitive Functions [PDF]
, 2010 Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high `complexity' according to various measures.
Drucker, Andrew
core +3 more sources
Gluing torsion endo-permutation modules [PDF]
, 2008 Given a finite p-group P, the main result gives necessary and sufficient conditions for obtaining a torsion endo-permutation module for P by gluing a compatible family of torsion endo-permutation modules for all sections N(Q)/Q, where Q runs among non ...
Bouc, Serge, Thévenaz, Jacques
core +1 more source
Infinite families of 3‐designs from APN functions [PDF]
Journal of combinatorial designs (Print), 2019 Combinatorial t ‐designs have nice applications in coding theory, finite geometries, and several engineering areas. A classical method for constructing t ‐designs is by the action of a permutation group that is t ‐transitive or t ‐homogeneous on a point ...
Chunming Tang
semanticscholar +1 more source
Vascular endothelial‐cadherin as a marker of endothelial injury in preclinical Alzheimer disease
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1926-1940, December 2022., 2022 Abstract Objective Endothelial dysfunction is an early and prevalent pathology in Alzheimer disease (AD). We here investigate the value of vascular endothelial‐cadherin (VEC) as a cerebrospinal fluid (CSF) marker of endothelial injury in preclinical AD.
Rawan Tarawneh +5 more
wiley +1 more source
Equivalences between blocks of cohomological Mackey algebras [PDF]
, 2014 Let $G$ be a finite group and $(K,\mathcal{O},k)$ be a $p$-modular system "large enough". Let $R=\mathcal{O}$ or $k$. There is a bijection between the blocks of the group algebra $RG$ and the central primitive idempotents (the blocks) of the so-called ...
Rognerud, Baptiste
core +2 more sources
Isomorphisms of subcategories of fusion systems of blocks and Clifford theory
, 2020 Let k be an algebraically closed field of prime characteristic p. Let G be a finite group, let N be a normal subgroup of G, and let c be a G-stable block of kN so that (kN)c{(kN)c} is a p-permutation G-algebra. As in Section 8.6 of [M. Linckelmann, The
M. E. Harris
semanticscholar +1 more source
On the primitivity of Lai-Massey schemes [PDF]
Mediterranean Journal of Mathematics, 2021, 18(4), 165, 2020 In symmetric cryptography, the round functions used as building blocks for iterated block ciphers are often obtained as the composition of different layers providing confusion and diffusion. The study of the conditions on such layers which make the group generated by the round functions of a block cipher a primitive group has been addressed in the past
arxiv +1 more source