Discrete Math Papers
@math_papers
Followers
1K
Following
4
Media
1K
Statuses
6K
Unofficial updates of discrete math papers on arXiv
Joined March 2017
Abelian and stochastic sandpile models on complete bipartite graphs
arxiv.org
In the sandpile model, vertices of a graph are allocated grains of sand. At each unit of time, a grain is added to a randomly chosen vertex. If that causes its number of grains to exceed its...
0
0
0
Reconfiguration of labeled matchings in triangular grid graphs
0
0
2
Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
0
0
1
Semidefinite programming and linear equations vs. homomorphism problems
arxiv.org
We introduce a relaxation for homomorphism problems that combines semidefinite programming with linear Diophantine equations, and propose a framework for the analysis of its power based on the...
0
0
0
Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
0
0
0
A Tie-breaking based Local Search Algorithm for Stable Matching Problems
arxiv.org
The stable marriage problem with incomplete lists and ties (SMTI) and the hospitals/residents problem with ties (HRT) are important in matching theory with broad practical applications. In this...
0
0
0
Boolean Functions with Small Approximate Spectral Norm
0
0
0
Decidability of Querying First-Order Theories via Countermodels of Finite Width
arxiv.org
We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are...
0
0
0
From Width-Based Model Checking to Width-Based Automated Theorem Proving
arxiv.org
In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial...
0
0
0
My part is bigger than yours -- assessment within a group of peers
arxiv.org
A project (e.g., writing a collaborative research paper) is often a group effort. At the end, each contributor identifies their contribution, often verbally. The reward, however, is very...
0
0
0
Efficient approximation schemes for scheduling on a stochastic number of machines
arxiv.org
We study three two-stage optimization problems with a similar structure and different objectives. In the first stage of each problem, the goal is to assign input jobs of positive sizes to...
0
0
0
Christoffel Matrices and Sturmian Determinants
arxiv.org
We discuss certain matrices associated with Christoffel words, and show that they have a group structure. We compute their determinants and show a relationship between the Zolotareff symbol from...
0
0
1