Results 41 to 50 of about 99,508 (238)
Ibadan Lectures on Toric Varieties
, 2017 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
New directions in enumerative chess problems [PDF]
, 2005 Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played.
Elkies, Noam D.
core +1 more source
Obstructions to combinatorial formulas for plethysm
, 2018 Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous polytopes of ...
Kahle, Thomas, Michalek, Mateusz
core +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
Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]
, 2013 A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries.
De Loera, Jesús A., Kim, Edward D.
core
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
Perspectives for proof unwinding by programming languages techniques [PDF]
, 2016 In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory.
Ilik, Danko
core +3 more sources
New bounds for equiangular lines
, 2014 A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming to improve the ...
Barg, Alexander, Yu, Wei-Hsuan
core +1 more source
Kingman, category and combinatorics [PDF]
, 2010 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
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics [PDF]
, 2022 Simeon Ball +2 more
openalex +1 more source