Results 101 to 110 of about 145,190 (272)

Girth in GF(q)$\textsf {GF}(q)$‐representable matroids

open access: yesBulletin 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

A focal boundary value problem for difference equations

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1993
The eigenvalue problem in difference equations, (−1)n−kΔny(t)=λ∑i=0k−1pi(t)Δiy(t), with Δty(0)=0, 0≤i≤k, Δk+iy(T+1)=0, 0 ...
Cathryn Denny, Darrel Hankerson
doaj   +1 more source

Teaching of probability theory and combinatorics at secondary schools

open access: yesLietuvos Matematikos Rinkinys, 2004
The topics of probability theory and combinatorics were brought into curricula of Lithuanian secondary schools ten years ago. The problems of teaching and actual situation of apprehension of concepts of prob­ability theory and combinatorics are analyzed.
Eugenijus Stankus
doaj   +1 more source

Hex and combinatorics

open access: yesDiscrete 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

Degrees and prime power order zeros of characters of symmetric and alternating groups

open access: yesBulletin 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

open access: yesBulletin 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

Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight

open access: yesExperimental 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

Working with Lowell

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
I have known Lowell Beineke for almost fifty years. Our first joint paper, on edge-colorings of graphs, was initiated in 1971, and since then we have produced further articles and nine books on graph theory, with another two books currently in progress ...
Robin Wilson
doaj   +1 more source

Enumeration of E ( s 2 )‐Optimal and Minimax‐Optimal Supersaturated Designs With 12 Rows, 11 q Columns and s max = 4

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.
ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley   +1 more source

Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2

open access: yesJournal 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

Home - About - Disclaimer - Privacy