Math-Co
Necessary Conditions for Geometric Realizability of Simplicial Complexes
Combinatorial Morse theory and minimality of hyperplane arrangements
Coincidences in 4 dimensions
Identifying almost sorted permutations from TCP buffer dynamics
On the Classification of Type II Codes of Length 24
On Isosceles Triangles and Related Problems in a Convex Polygon
Dualities and dual pairs in Heyting algebras
Triple-loop networks with arbitrarily many minimum distance diagrams
Decomposition of Geometric Set Systems and Graphs
New graph polynomials from the Bethe approximation of the Ising partition function
Generating All Partitions: A Comparison Of Two Encodings
SQS-graphs of Soloveva-Phelps codes
Optimal Partial Tiling of Manhattan Polyominoes
Rigid Components of Random Graphs
Fair Partitions of Polygons - an Introduction
On the dynamics of Social Balance on general networks (with an application to XOR-SAT)
Characterizing Optimal Sampling of Binary Contingency Tables via the Configuration Model
Natural realizations of sparsity matroids
Cover-Decomposition and Polychromatic Numbers
Constructive Algorithms for Discrepancy Minimization
Mean asymptotic behaviour of radix-rational sequences and dilation equations (Extended version)
Double Clustering and Graph Navigability
