Results 51 to 60 of about 173,309,485 (168)
A generalisation of Cameron's base size conjecture
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract Let G⩽Sym(Ω)$G\leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser H$H$. A base for G$G$ is a subset of Ω$\Omega$ whose pointwise stabiliser is trivial, and the minimal cardinality of a base is called the base size of G$G$, denoted by b(G,Ω)$b(G, \Omega)$. Equivalently, b(G,Ω)$b(G, \Omega)$ is the minimal
Marina Anagnostopoulou‐Merkouri
wiley +1 more source
The asymptotic Mahler measure of Gaussian periods
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen +2 more
wiley +1 more source
Intelligent Information Management, 2012 We investigate how the code automorphism group can be used to study such combinatorial object as codes. Consider GF(qn) as a vector over GF(q). For any k = 0, 1, 2, 3, ???, n. Which GF(qn) exactly one subspace C of dimension k and which is invariant under the automorphism.
openaire +1 more source
An elegant model of the geodesic flow on the modular surface
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley +1 more source
On Calculation of Monomial Automorphisms of Linear Cyclic Codes
, 2020 © 2018, Pleiades Publishing, Ltd. A description of the monomial automorphisms group of an arbitrary linear cyclic code in term of polynomials is presented.
Kugurakov V. +2 more
core
On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]
, 2005 Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core +1 more source
Automorphism Set Construction for Automorphism Ensemble Decoding With Reduced Delay
IEEE Open Journal of the Communications SocietyThe anticipated demands of 6G ultra-reliable low-latency communications (URLLC) call for near-instantaneous data transfers and error-correction efficiency rivaling maximum-likelihood (ML) decoding. Achieving an effective compromise between latency, power
Anna Fominykh, Kirill Shabunov
doaj +1 more source
Foundation Models in Diagnosis of Ophthalmic Diseases: Construction and Application
Eye &ENT Research, Volume 3, Issue 2, Page 45-58, June 2026.ABSTRACT Artificial intelligence holds promise for addressing the uneven distribution of medical resources across different regions. Compared with convolutional neural network models, foundation models offer significant advantages: on one hand, their pre‐training does not rely on massive labeled data; on the other hand, they possess the capability to ...
Xiaolu Huang +7 more
wiley +1 more source
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
wiley +1 more source
On the automorphism groups of some AG-codes based on C_{a,b} curves [PDF]
, 2006 We study Ca,b curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code.
Wang, Quang, Shaska, Tony
core +1 more source