Related papers: On the Congruency-Constrained Matroid Base

We present a simple, work-optimal and synchronization-free solution to the problem of stably merging in parallel two given, ordered arrays of m and n elements into an ordered array of m+n elements. The main contribution is a new, simple,…

In this study, we consider a class of linear matroid interdiction problems, where the feasible sets for the upper-level decision-maker (referred to as a leader) and the lower-level decision-maker (referred to as a follower) are induced by…

In this paper, we show that the time complexity of monotone min-plus product of two $n\times n$ matrices is $\tilde{O}(n^{(3+\omega)/2})=\tilde{O}(n^{2.687})$, where $\omega < 2.373$ is the fast matrix multiplication exponent [Alman and…

We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…

Submodular maximization subject to matroid constraints is a central problem with many applications in machine learning. As algorithms are increasingly used in decision-making over datapoints with sensitive attributes such as gender or race,…

The control and sensing of large-scale systems results in combinatorial problems not only for sensor and actuator placement but also for scheduling or observability/controllability. Such combinatorial constraints in system design and…

A theory of single-element extensions of integer polymatroids analogous to that of matroids is developed. We present an algorithm to generate a catalog of $2$-polymatroids, up to isomorphism. When we implemented this algorithm on a…

In binary jumbled pattern matching we wish to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of size $i$ and has exactly $j$ 1-bits. The problem naturally generalizes to…

It is conjectured that for a perfect number $m,$ $\rm{rad}(m)\ll m^{\frac{1}{2}}.$ We prove bounds on the radical of multiperfect number $m$ depending on its abundancy index. Assuming the ABC conjecture, we apply this result to study gaps…

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

Describing minimal generating set of a toric ideal is a well-studied and difficult problem. In 1980 White conjectured that the toric ideal associated to a matroid is equal to the ideal generated by quadratic binomials corresponding to…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

This paper develops matroidal analogues of classical results on matchings in abelian groups. By embedding matroid ground sets in an abelian group, we introduce base matchings between matroid bases, recover the group-theoretic setting in the…

Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same $n$-element ground set, the matroid intersection problem is to find a largest common independent set, whose size we denote by $r$. We present a simple and generic auction…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…