Results 71 to 80 of about 374 (164)
The DNA of Calabi–Yau Hypersurfaces
Fortschritte der Physik, Volume 74, Issue 2, February 2026.Abstract Genetic Algorithms are implemented for triangulations of four‐dimensional reflexive polytopes, which induce Calabi–Yau threefold hypersurfaces via Batyrev's construction. These algorithms are shown to efficiently optimize physical observables such as axion decay constants or axion–photon couplings in string theory compactifications.
Nate MacFadden +2 more
wiley +1 more source
On authomorphisms of extremal type II codes
Revista Integración, 2013 In this article we present some techniques to determine the types of automorphisms of extremal doubly even binary self-dual codes, also called extremal type II codes, with parameters [24, 12, 8], [48, 24, 12] and [120, 60, 24].
Ismael Gutiérrez García +1 more
doaj
A general approach to the linear stability of viscoelastic shear‐flows
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, Volume 106, Issue 2, February 2026.Abstract The present work provides an in‐depth analysis of the linear stability theory of viscoelastic shear‐flows, based upon a constitutive equation of the fading memory type. The particular model considered herein was introduced by Kenneth Walters through the integration of classical rate‐type fluids in a convected frame (Walters 1962).
Johannes Conrad, Martin Oberlack
wiley +1 more source
Constructions, decoding and automorphisms of subspace codes [PDF]
, 2013 Subspace codes are a family of codes used for (among others) random network coding, which is a model for multicast communication. These codes are defined as sets of vector spaces over a finite field.
Trautmann, Anna-Lena
core +1 more source
The cosymplectic Chern–Hamilton conjecture
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In this paper, we study the Chern–Hamilton energy functional on compact cosymplectic manifolds, fully classifying in dimension 3 those manifolds admitting a critical compatible metric for this functional. This is the case if and only if either the manifold is co‐Kähler or if it is a mapping torus of the 2‐torus by a hyperbolic toral ...
Søren Dyhr +3 more
wiley +1 more source
Derangements in intransitive groups
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract Let G$G$ be a nontrivial permutation group of degree n$n$. If G$G$ is transitive, then a theorem of Jordan states that G$G$ has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If G$G$ is intransitive, then G$G$ may fail to have a derangement, and this can happen even if G$G$ has only two ...
David Ellis, Scott Harper
wiley +1 more source
Which extended goppa codes are cyclic? [PDF]
, 1989 This paper contains a partial solution of a problem of MacWilliams and Sloane concerning the cyclicity of an extended “classical” Goppa code. The main idea of the proof is to represent the code as a “geometric” Goppa code.over the rational function field
Stichtenoth, Henning
core +1 more source
On the structure of the linear codes with a given automorphism
Advances in Mathematics of CommunicationsThe purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic codes and almost quasi-cyclic codes are discussed in detail, presenting necessary and sufficient conditions for which
openaire +3 more sources
Polar Codes Do Not Have Many Affine Automorphisms [PDF]
Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research
Ivanov, Kirill, Urbanke, Rudiger
core +1 more source