Results 31 to 40 of about 145 (141)
Entropy rigidity for cusped Hitchin representations
Abstract We establish an entropy rigidity theorem for Hitchin representations of geometrically finite Fuchsian groups which generalizes a theorem of Potrie and Sambarino for Hitchin representations of closed surface groups. In the process, we introduce the class of (1,1,2)‐hypertransverse groups and show for such a group that the Hausdorff dimension of
Richard Canary +2 more
wiley +1 more source
The DNA of Calabi–Yau Hypersurfaces
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
Constituent Automorphism Decoding of Reed-Muller Codes
11 pages, 8 figures, 5 ...
Yicheng Qu +2 more
openaire +2 more sources
Generalized Automorphisms of Channel Codes: Properties, Code Design, and a Decoder
Low-density parity-check codes together with belief propagation (BP) decoding are known to be well-performing for large block lengths. However, for short block lengths there is still a considerable gap between the performance of the BP decoder and the maximum likelihood decoder.
Mandelbaum, Jonathan +2 more
openaire +3 more sources
A general approach to the linear stability of viscoelastic shear‐flows
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
Error-correcting codes for fermionic quantum simulation
Utilizing the framework of $\mathbb{Z}_2$ lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms
Yu-An Chen, Alexey V. Gorshkov, Yijia Xu
doaj +1 more source
On automorphisms of generalized algebraic-geometry codes
In coding theory, one often is interested in codes admitting large automorphism group. Certainly, the knowledge of the automorphism group of a code or even of part of this group gives information about the structure of the code and can allow to developing a decoding algorithm. In [IEEE Trans. Inform. Theory 45, No. 7, 2498--2501 (1999; Zbl 0956.94023)]
openaire +2 more sources
The cosymplectic Chern–Hamilton conjecture
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
Successive Cancellation Automorphism List Decoding of Polar Codes
The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths. This paper introduces Successive Cancellation Automorphism List (SCAL) decoding of polar codes as a novel application of automorphisms ...
Johannsen, Lucas +5 more
openaire +2 more sources
Derangements in intransitive groups
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

