Related papers: Bounded-box reductions in the Subbarao-Warren prob…

For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…

We show variants of the genus inequality for the irreducible components of the special fiber of an arithmetic curve over a henselian discrete valuation ring of residue characteristic zero that take into account the non-existence of…

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

The Casas--Alvero conjecture predicts that every univariate polynomial over a field of characteristic zero having a common factor with each of its derivatives $H_i(f)$ is a power of a linear polynomial. One approach to proving the…

Over an arbitrary field $\mathbb{F}$, Harbourne conjectured that $$I^{(N (r-1)+1)} \subseteq I^r$$ for all $r>0$ and all homogeneous ideals $I$ in $S = \mathbb{F} [\mathbb{P}^N] = \mathbb{F} [x_0, \ldots, x_N]$. The conjecture has been…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…

This paper develops a Mellin-Laplace analytic framework for the fixed-shift prime correlation r_h(n) = Lambda(n) Lambda(n+h) for h not equal to 0. This sequence has no multiplicative structure, no Euler product, and no singularity at s = 1.…

We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier…

In this paper, we study the complexity of two types of digraph packing problems: perfect out-forests problem and Steiner cycle packing problem. For the perfect out-forest problem, we prove that it is NP-hard to decide whether a given strong…

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

In 1981, Erd\H{o}s and Faudree asked whether there exists an infinite family of graphs $G_N$ on $N$ vertices with $\Delta(G_N)<N-1$ and $\sri(G_N)=1$, and whether every family with $|V(G_N)|=N$ and $\Delta(G_N)<c$ for some fixed constant…

In the {\sc Hitting Set} problem, we are given a collection $\cal F$ of subsets of a ground set $V$ and an integer $p$, and asked whether $V$ has a $p$-element subset that intersects each set in $\cal F$. We consider two parameterizations…

Given any finite quiver, we consider a complete flag of vector spaces over each vertex. Consider the unipotent invariant subalgebra of the coordinate ring of the filtered quiver representation subspace. We prove that the dimension of the…

Assume that $Au=f,\quad (1)$ is a solvable linear equation in a Hilbert space $H$, $A$ is a linear, closed, densely defined, unbounded operator in $H$, which is not boundedly invertible, so problem (1) is ill-posed. It is proved that the…

The factor graph of an instance of a symmetric constraint satisfaction problem on n Boolean variables and m constraints (CSPs such as k-SAT, k-AND, k-LIN) is a bipartite graph describing which variables appear in which constraints. The…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

We proved that for every sufficiently large $n$, the complete graph $K_{2n}$ with an arbitrary edge signing $\sigma: E(K_{2n}) \to \{-1, +1\}$ admits a high discrepancy $1$-factor decomposition. That is, there exists a universal constant $c…