Related papers: Coordinate deletion of zeroes
In the snippets problem, the goal is to preprocess text $T$ so that given two patterns $P_1$ and $P_2$, one can locate the occurrences of the two patterns in $T$ that are closest to each other, or report their distance. Kopelowitz and…
A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…
Document shadows are a major obstacle in the digitization process. Due to the dense information in text and patterns covered by shadows, document shadow removal requires specialized methods. Existing document shadow removal methods,…
The challenges surrounding the application of image shadow removal to real-world images and not just constrained datasets like ISTD/SRD have highlighted an urgent need for zero-shot learning in this field. In this study, we innovatively…
Shadows often occur when we capture the documents with casual equipment, which influences the visual quality and readability of the digital copies. Different from the algorithms for natural shadow removal, the algorithms in document shadow…
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected graphs the problem is to determine an encoding-decoding scheme for each member of the family such that we can decode the adjacency…
A set $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total domination number of $G$ is the minimum cardinality of any total dominating set of $G$ and is denoted…
Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…
We describe non-trivial $\delta$-derivations of semisimple finite-dimensional Jordan algebras over an algebraically closed field of characteristic not 2, and of simple finite-dimensional Jordan superalgebras over an algebraically closed…
In this paper we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree $\Delta$. For graphs the largest zero-free disk around zero was described by Shearer as having radius…
We study the task of list-decodable linear regression using batches. A batch is called clean if it consists of i.i.d. samples from an unknown linear regression distribution. For a parameter $\alpha \in (0, 1/2)$, an unknown…
With transformer-based models and the pretrain-finetune paradigm becoming mainstream, the high storage and deployment costs of individual finetuned models on multiple tasks pose critical challenges. Delta compression attempts to lower the…
A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $a_1<a_2<\cdots<a_k$ such that $a_i-a_{i-1}\in D$ for $i=2,3,\cdots,k$. For $k\in\mathbb{Z}^+$ and $D\subset \mathbb{Z}^+$, we define…
The degree distribution, referred to as the delta-sequence of a network is studied. Using the non-normalized Lorenz curve, we apply a generalized form of the classical majorization partial order. Next, we introduce a new class of small…
If $A$ is a compact operator in a Banach space and some power $A^q$ is nuclear we give a criterion of $\mathbb{Z}_{d}$ -- symmetry of its spectrum $\sigma{A}$ in terms of vanishing of the traces $\mathop{\mathit{Trace}} A^n$ for all $n$, $n…
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so…
Let $\Gamma=(V,E)$ be a simple graph. For a nonempty set $X\subseteq V$, and a vertex $v\in V$, $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X$. A nonempty set $S\subseteq V$ is a \emph{defensive $k$-alliance} in…
Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the…
Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…