1. Finding or constraining "last common ancestors" in digraphs
  2. A property of 47 with respect to partitions into five parts
  3. Generalized Newton Identities

  4. Alternative parallel paths

  5. Decompostion of hook schur function in terms of cauchy product of holonomic functions

  6. How many positions of a tile can occur in a periodic tiling?
  7. Multiplicities of ordered pairs in pairing of two multisets

  8. Sets of evenly distributed points in the Euclidean plane

  9. Szemeredi-Trotter Theorem for hyperplanes in 4-space $H \subset \mathbb{C}^2$

  10. Are there polygonal tilings with infinitely many positions, each (or at least one) occurring infinitely often?
  11. Recover orthogonal from an orthostochastic matrix
  12. Derivative of Tutte polynomial at -1
  13. How many positions of a tiling polygon can occur simultaneousy?
  14. Poset of nonvanishing minors of a matrix
  15. Why do finitely many cluster variables imply finitely many y-variables?

  16. an application of nth moment of Poisson distribution with stirling number

  17. Union of pairwise almost disjoint sets

  18. Is there a good bound for this double exponential recursion?

  19. The set of complements equal to the complement of set
  20. How many different playlists are possible?

  21. Does CLT hold for joint distribution of two dependent binomial variables?
  22. Bipartite Graphs arising from two k-partitions of a given Graph

  23. What is known about the following partial order (subquotients of linearly ordered set)
  24. Infinite subset of $\mathbb{N}$ almost avoiding all "zebra crossings"

  25. 40 = (4*1) + (4*2) + (4*7) in relation to OEIS A075308

  26. Partition a square into sub-rectangles with restrictions
  27. On a permanent related rank?

  28. Tail bound of a distribution

  29. Invariants of exterior powers

  30. Cut norm and biclique gap?
  31. An upper bound for skew symmetric rank 2 matrices
  32. Name of the sum of the $k$-wise product of distinct integers from $1$ to $n$

  33. Vanishing line on Conway's game of life
  34. What does this permutation polynomial look like?
  35. Almost blocking sets in $\mathbb F_q^2$
  36. Balancing out edge multiplicites in a graph
  37. Characterizing SP-DAGs by Forbidden Minors?
  38. An explicit formula for the number of different (non isomorphic) simple graphs with $p$ vertices and $q$ edges

  39. Binary weight of shifted integers

  40. Controlling tree-width by excluding long holes

  41. Number of binary arrays of length n with k consecutive 1's
  42. Generating Uniquely k-Optimal Point Sets
  43. Proof of $\sum_{k=1}^n \binom{n}{k} \binom{n}{n+1-k} = \binom{2n}{n+1}$ via Induction
  44. Paper request: Constructing Joint Mass Distributions with Constraints
  45. Finding a semi-sparse vertex in a grid
  46. Derangements and Lagrange Remainder

  47. $E_8$ roots, OEIS entry A000712, and "Number of partitions of n into parts of 2 kinds"
  48. Automorphisms of the modular product of graphs

  49. Curious Catalan convolutions

  50. Combinatorial proof for the number of lattice paths that return to the axis only at times that are a multiple of 4

  51. Reference for an edge-matching problem

  52. What are the patterns of the sequence of polynomials?

  53. Combinatorial 0-1 vector problem
  54. Convex polytopes as "products" of lower dimensional polytopes of the same family

  55. Random Up-walk on Young's Lattice

  56. Bound on the number of skew symmetric matrices of rank 4
  57. What is a chess piece mathematically?
  58. A combinatorial 0-1 matrix problem

  59. 0-1 matrix combinatorial problem

  60. How to generate a Latin square $M'$ in the same main class as $M \in \mathrm{LS}(9)$ which agrees with $L$ in the most cells?

  61. Number of iterations required for a transposition cipher to yield the original input

  62. Singularity of torus fixed points from combinatorial data
  63. Automated search for bijective proofs

  64. Choosing $K$ "centers" from the space of permutations
  65. Is there a combinatorial reason that the (-1)st Catalan number is -1/2?
  66. H-generalized join graph
  67. Tessellating $\mathbb{R}^n$ by bricks.
  68. Maximum bipartite graph (1,n) "matching"
  69. Bounding sum of multinomial coefficients by highest entropy one
  70. Analogue of conic sections for the permutohedra, associahedra, and noncrossing partitions
  71. A question about finite free convolution
  72. Positivity of Ehrhart polynomial coefficients
  73. Partition of sets of monomials
  74. Proof of identity involving Stirling numbers of the second kind
  75. Which 3-regular graphs are Schreier coset graphs

  76. A double grading of catalan numbers

  77. How many bits/questions does it take to identify the most frequent number in an array?

  78. Variation of Pursuit-evasion (Cops and Robbers)

  79. Why do polytopes pop up in Lagrange inversion?

  80. Coupon Collector - Subset collection version

  81. Explicit forms for the roots of Eulerian polynomials
  82. Tartaglia distribution
  83. Kelly's theorem about a resolution of the Sylvester–Gallai problem
  84. A proof of Edelstein and Kelly theorem

  85. Upper bound on the number of permutations in a set during an algorithm
  86. Maximal number of intersecting subspaces of a finite dimensional vector space
  87. Quantified imbalance in signed graphs

  88. Term for the maximum number of vertices per depth of a rooted tree
  89. Asymptotic holonomic

  90. The "sensitivity" of 2-colorings of the d-dimensional integer lattice
  91. How many "different" colorings (excluding exchanges) exist for a given map (graph)?
  92. Permutations with restricted pairwise intersections

  93. Regular unimodular triangulation for a certain simplex
  94. Möbius function on atomistic (modular) lattices

  95. Hall type theorem for saturations of subsets of bipartite graphs

  96. Long loops in critical random graphs

  97. Relationship of Weisfeiler-Lehman algorithm to weak isomorphism of coherent algebras

  98. Set counting problem with a cap on the intersection between the set and a fixed partition

  99. A game of plates and olives

  100. Uniform bound for rare events