Results 51 to 60 of about 143,013 (228)
Discrete Mathematics, 2006 AbstractInspired by Claude Berge's interest in and writings on Hex, we discuss some results on the game.
Jack van Rijswijck, Ryan B. Hayward
openaire +2 more sources
Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
Bulletin of the London Mathematical Society, EarlyView.Abstract We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field GF(q)$\textsf {GF}(q)$ and any integer t$t$, every cosimple GF(q)$\textsf {GF}(q)$‐representable matroid with sufficiently large girth contains either M(Kt)$M(K_t)$ or M(Kt)∗$M(K_t)^*$ as a minor.
James Davies +4 more
wiley +1 more source
Degrees and prime power order zeros of characters of symmetric and alternating groups
Bulletin of the London Mathematical Society, EarlyView.Abstract We show that the p$p$‐part of the degree of an irreducible character of a symmetric group is completely determined by the set of vanishing elements of p$p$‐power order. As a corollary, we deduce that the set of zeros of prime power order controls the degree of such a character. The same problem is analysed for alternating groups, where we show
Eugenio Giannelli +2 more
wiley +1 more source
Growth problems in diagram categories
Bulletin of the London Mathematical Society, EarlyView.Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
Centrality of star and monotone factorisations
Bulletin of the London Mathematical Society, EarlyView.Abstract A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid in all genera, which answers a natural question of Goulden and Jackson from 2009.
Jesse Campion Loth, Amarpreet Rattan
wiley +1 more source
Ore's theorem on subfactor planar algebras
, 2019 This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection.
Palcoux, Sebastien
core
Markov's conjecture on integral necklaces
Bulletin of the London Mathematical Society, EarlyView.Abstract We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum of the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
David Fisac
wiley +1 more source
On stabilizers in finite permutation groups
Bulletin of the London Mathematical Society, EarlyView.Abstract Let G$G$ be a permutation group on the finite set Ω$\Omega$. We prove various results about partitions of Ω$\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set‐stabilizer whose orbits have length at most 6, which is best possible and answers two questions of Babai.
Luca Sabatini
wiley +1 more source
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
Invariants of finite groups and their applications to combinatorics [PDF]
, 1979 Richard P. Stanley
openalex +1 more source