Related papers: Note on random Latin squares and the triangle remo…
There are three main thrusts to this article: a new proof of Levi's Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that…
Consider a partial Latin square $P$ where the first two rows and first three columns are completely filled, and every other cell of $P$ is empty. It has been conjectured that all such partial Latin squares of order at least $8$ are…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The Dinitz conjecture states that, for each $n$ and for every collection of $n$-element sets $S_{ij}$, an $n\times n$ partial latin square can be found with the $(i,j)$\<th entry taken from $S_{ij}$. The analogous statement for $(n-1)\times…
Given an edge-weighted metric complete graph with $n$ vertices, the maximum weight metric triangle packing problem is to find a set of $n/3$ vertex-disjoint triangles with the total weight of all triangles in the packing maximized. Several…
We propose a Monte Carlo method to efficiently find, count, and sample abstract triangulations of a given manifold M. The method is based on a biased random walk through all possible triangulations of M (in the Pachner graph), constructed…
For any distribution $\pi$ with support equal to $[n] = \{1, 2,..., n \}$, we study the set $\mathcal{A}_{\pi}$ of tridiagonal stochastic matrices $K$ satisfying $\pi(i) K[i,j] = \pi(j) K[j,i]$ for all $i, j \in [n]$. These matrices…
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…
The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important…
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the…
In this paper, we present perturbation analysis and randomized algorithms for the total least squares (TLS) problems. We derive the perturbation bound and check its sharpness by numerical experiments. Motivated by the recently popular…
In 1782, Euler conjectured that no Latin square of order $n\equiv 2\; \textrm{mod}\; 4$ has a decomposition into transversals. While confirmed for $n=6$ by Tarry in 1900, Bose, Parker, and Shrikhande constructed counterexamples in 1960 for…
Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect…
We study the connection between mutually unbiased bases and mutually orthogonal extraordinary supersquares, a wider class of squares which does not contain only the Latin squares. We show that there are four types of complete sets of…
We prescribe the minimal set of experimental data and parameters that should be reported for random-laser experiments and models. This prescript allows for a quantitative comparison between different experiments, and for a criterion whether…
The randomized Kaczmarz algorithm has received considerable attention recently because of its simplicity, speed, and the ability to approximately solve large-scale linear systems of equations. In this paper we propose randomized double and…
A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square B_n, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We give a…
The paper "An efficient sampling scheme for the eigenvalues of dual Wishart matrices", by I.~Santamar\'ia and V.~Elvira, [\emph{IEEE Signal Processing Letters}, vol.~28, pp.~2177--2181, 2021] \cite{SE21}, poses the question of efficient…
The main thrust of the article is to provide interesting example, useful for students of using bitwise operations in the programming languages C ++ and Java. As an example, we describe an algorithm for obtaining a Latin square of arbitrary…
Computation of the probability that a random graph is connected is a challenging problem, so it is natural to turn to approximations such as Monte Carlo methods. We describe sequential importance resampling and splitting algorithms for the…