Results 51 to 60 of about 98,708 (229)
Learning Design For Combinatoric With Realistic Mathematics Education Approach [PDF]
Dona Fitriawan+2 more
openalex +1 more source
Girth in GF(q)$\textsf {GF}(q)$‐representable matroids
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
Ibadan Lectures on Toric Varieties
Toric varieties are perhaps the most accessible class of algebraic varieties. They often arise as varieties parameterized by monomials, and their structure may be completely understood through objects from geometric combinatorics.
Sottile, Frank
core
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions
Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the desired size ...
Bernstein, Megan+2 more
core +1 more source
Degrees and prime power order zeros of characters of symmetric and alternating groups
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
The combinatorics of scattering in layered media [PDF]
Reflection and transmission of waves in piecewise constant layered media are important in various imaging modalities and have been studied extensively. Despite this, no exact time domain formulas for the Green's functions have been established.
Gibson, Peter C.
core
On positivity of Ehrhart polynomials
Ehrhart discovered that the function that counts the number of lattice points in dilations of an integral polytope is a polynomial. We call the coefficients of this polynomial Ehrhart coefficients, and say a polytope is Ehrhart positive if all Ehrhart ...
Alexander Postnikov+48 more
core +1 more source
Growth problems in diagram categories
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
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics [PDF]
Simeon Ball+2 more
openalex +1 more source
Kingman, category and combinatorics [PDF]
34 pages. To appear in Bingham, N. H., and Goldie, C. M. (eds), Probability and Mathematical Genetics: Papers in Honour of Sir John Kingman. London Math. Soc. Lecture Note Series.
Adam Ostaszewski, N. H. Bingham
openaire +3 more sources