Results 31 to 40 of about 5,176 (95)
Siegel–Veech constants for cyclic covers of generic translation surfaces
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We compute the asymptotic number of cylinders, weighted by their area to any nonnegative power, on any cyclic branched cover of any generic translation surface in any stratum. Our formulae depend only on topological invariants of the cover and number‐theoretic properties of the degree: in particular, the ratio of the related Siegel–Veech ...
David Aulicino +4 more
wiley +1 more source
On the Automorphism Groups of some AG-Codes Based on Ca;b Curves [PDF]
, 2007 *Partially supported by NATO.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.
Shaska, Tanush, Wang, Quanlong
core
Propelinear 1-perfect codes from quadratic functions
, 2014 Perfect codes obtained by the Vasil'ev--Sch\"onheim construction from a linear base code and quadratic switching functions are transitive and, moreover, propelinear.
Krotov, Denis, Potapov, Vladimir
core +1 more source
Random planar trees and the Jacobian conjecture
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping F:Cn→Cn$F\colon \mathbb {C}^n \rightarrow \mathbb {C}^n$ whose Jacobian determinant is a non‐zero constant) has a compositional inverse which is also a polynomial. The Jacobian conjecture may be formulated in
Elia Bisi +5 more
wiley +1 more source
Construction of Codes for Network Coding [PDF]
, 2010 Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a purely ...
Elsenhans, Andreas-Stephan +2 more
core
, 2015 We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.Comment: Improved exposition according to the referees ...
Nebe, Gabriele, Willems, Wolfgang
core +1 more source
Annalen der Physik, Volume 537, Issue 12, December 2025.A set of particle representations, familiar from the Standard Model, collectively form a superalgebra. Those representations mirroring the behaviour of the Standard Model's gauge bosons, and three generations of fermions, are each included in this algebra, with exception only to those representations involving the top quark.
N. Furey
wiley +1 more source
New Binary Extremal Self-Dual Codes of Lengths 50 and 52 [PDF]
, 1999 * This work was partially supported by the Bulgarian National Science Fund under Contract No. MM – 503/1995.New extremal binary self-dual codes of lengths 50 and 52 are constructed. Some of them are the first known codes with such weight enumerators. The
Buyuklieva, Stefka
core
Construction of Large Constant Dimension Codes With a Prescribed Minimum Distance
, 2008 In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is also a connection
Kohnert, Axel, Kurz, Sascha
core +2 more sources
Hom ω$\omega$‐categories of a computad are free
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract We provide a new description of the hom functor on weak ω$\omega$‐categories, and show that it admits a left adjoint that we call the suspension functor. We then show that the hom functor preserves the property of being free on a computad, in contrast to the hom functor for strict ω$\omega$‐categories.
Thibaut Benjamin, Ioannis Markakis
wiley +1 more source