You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
None
None
We prove here the Martino-Priddy conjecture at the prime $2$: the $2$-completions of the classifying spaces of two finite groups $G$ and $G'$ are homotopy equivalent if and only if there is an isomorphism between their Sylow $2$-subgroups which preserves fusion. This is a consequence of a technical algebraic result, which says that for a finite group $G$, the second higher derived functor of the inverse limit vanishes for a certain functor $\mathcal{Z}_G$ on the $2$-subgroup orbit category of $G$. The proof of this result uses the classification theorem for finite simple groups.
This book offers a systematic introduction to recent achievements and development in research on the structure of finite non-simple groups, the theory of classes of groups and their applications. In particular, the related systematic theories are considered and some new approaches and research methods are described – e.g., the F-hypercenter of groups, X-permutable subgroups, subgroup functors, generalized supplementary subgroups, quasi-F-group, and F-cohypercenter for Fitting classes. At the end of each chapter, we provide relevant supplementary information and introduce readers to selected open problems.
This volume constitutes selected papers presented at the First Inernational Conference on Ubiquitous Security, UbiSec 2021, held in Guangzhou, China, in December 2021. The presented 26 full papers and 2 short papers were thoroughly reviewed and selected from the 96 submissions. They focus on security, privacy and anonymity aspects in cyberspace, physical world, and social networks.
This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. The book is appropriate for researchers in theoretical computer science, in particular computational complexity.
This book presents state-of-the-art lectures delivered by international academic and industrial experts in the field of computational science and its education, covering a wide spectrum from theory to practice. Topics include new developments in finite element method (FEM), finite volume method and Spline theory, such as Moving Mesh Methods, Galerkin and Discontinuous Galerkin Schemes, Shape Gradient Methods, Mixed FEMs, Superconvergence techniques and Fourier spectral approximations with applications in multidimensional fluid dynamics; Maxwell equations in discrepancy media; and phase-field equations. It also discusses some interesting topics related to Stokes equations, Schrodinger equations, wavelet analysis and approximation theory. Contemporary teaching issues in curriculum reform also form an integral part of the book. This book will therefore be of significant interest and value to all graduates, research scientists and practitioners facing complex computational problems. Administrators and policymakers will find it is an addition to their mathematics curriculum reform libraries.