Results 51 to 60 of about 5,176 (95)
Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 399-403, October 2025.ABSTRACT The largest prime p that can be the order of an automorphism of a 2‐ ( 35 , 17 , 8 ) design is p = 17, and all 2‐ ( 35 , 17 , 8 ) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐ ( 35 , 17 , 8 ) designs with automorphisms of an odd prime order p < 17 were classified in Bouyukliev, Fack and Winne and ...
Sanja Rukavina, Vladimir D. Tonchev
wiley +1 more source
Longest cycles in vertex‐transitive and highly connected graphs
Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2975-2990, October 2025.Abstract We present progress on three old conjectures about longest paths and cycles in graphs. The first pair of conjectures, due to Lovász from 1969 and Thomassen from 1978, respectively, states that all connected vertex‐transitive graphs contain a Hamiltonian path, and that all sufficiently large such graphs even contain a Hamiltonian cycle.
Carla Groenland +4 more
wiley +1 more source
The Automorphism Group of an Extremal [72,36,16] Code does not contain elements of order 6
, 2012 The existence of an extremal code of length 72 is a long-standing open problem. Let C be a putative extremal code of length 72 and suppose that C has an automorphism g of order 6.
Borello, Martino
core +1 more source
On fixed‐point‐free involutions in actions of finite exceptional groups of Lie type
Journal of the London Mathematical Society, Volume 112, Issue 3, September 2025.Abstract Let G$G$ be a nontrivial transitive permutation group on a finite set Ω$\Omega$. By a classical theorem of Jordan, G$G$ contains a derangement, which is an element with no fixed points on Ω$\Omega$. Given a prime divisor r$r$ of |Ω|$|\Omega |$, we say that G$G$ is r$r$‐elusive if it does not contain a derangement of order r$r$. In a paper from
Timothy C. Burness, Mikko Korhonen
wiley +1 more source
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym ( 7 )
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 261-274, July 2025.ABSTRACT Terwilliger algebras are finite‐dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance‐regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups Sym ( n ), for 3 ≤ n ≤ 6, have been studied and completely determined ...
Allen Herman +2 more
wiley +1 more source
Spanning Multi‐Asset Payoffs With ReLUs
Mathematical Finance, Volume 35, Issue 3, Page 682-707, July 2025.ABSTRACT We propose a distributional formulation of the spanning problem of a multi‐asset payoff by vanilla basket options. This problem is shown to have a unique solution if and only if the payoff function is even and absolutely homogeneous, and we establish a Fourier‐based formula to calculate the solution.
Sébastien Bossu +2 more
wiley +1 more source
Pigment Cell &Melanoma Research, Volume 38, Issue 4, July 2025.ABSTRACT The retinal pigment epithelium (RPE) is a specialised monolayer of pigmented epithelial cells in the outer retina. The extent to which RPE pigmentation is related to that of other tissues remains unclear. We utilised RPE thickness measured using optical coherence tomography (OCT) imaging as an indicator of RPE melanin content.
Thomas H Julian +4 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
Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals
Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.Abstract Motivated by recent work of Boney, Dimopoulos, Gitman, and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to show that, in contrast to the existence of strong compactness cardinals, the existence of weak ...
Philipp Lücke
wiley +1 more source
Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II. [PDF]
Life (Basel), 2023 José MV, Morgado ER, Bobadilla JR.
europepmc +1 more source