6 citations · 10 across the 3 of their papers we have counts for
6 papers
A lower bound for the -queens problem
Zur Luria, Michael Simkin
The -queens puzzle is to place mutually non-attacking queens on an chessboard. We present a simple two stage randomized algorithm to construct such configuratio…
On simple connectivity of random 2-complexes
Zur Luria, Yuval Peled
The fundamental group of the -dimensional Linial-Meshulam random simplicial complex was first studied by Babson, Hoffman and Kahle. They proved that the threshold pro…
Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs
Roman Glebov, Zur Luria, Michael Simkin
Consider the random process in which the edges of a graph are added one by one in a random order. A classical result states that if is the complete graph or the co…
New bounds on the number of n-queens configurations
Zur Luria
In how many ways can queens be placed on an chessboard so that no two queens attack each other? This is the famous -queens problem. Let denote the number…
On the maximum number of Latin transversals
Roman Glebov, Zur Luria
Let denote the maximal number of transversals in an order- Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left…
On the vertices of the d-dimensional Birkhoff polytope
Nathan Linial, Zur Luria
Consider the Birkhoff polytope of n by n doubly-stochastic matrices. As the Birkhoff-von Neumann theorem famously states, its vertex set coincides with the set of all n by n permut…