Related papers: Bounds on Sweep-Covers by Raney Numbers
This paper has been withdrawn by the author, due to the fact that the main result in it has already been obtained in [1] for any c < e, see also [2] and [3]. Moreover the formula which gives the minimal vertex-cover in a tree (see the…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
In this paper, we provide bounds for the genus of the pancake graph $\mathbb{P}_n$, burnt pancake graph $\mathbb{BP}_n$, and undirected generalized pancake graph $\mathbb{P}_m(n)$. Our upper bound for $\mathbb{P}_n$ is sharper than the…
For a simple graph $G=(V,E),$ let $\mathcal{S}_+(G)$ denote the set of real positive semidefinite matrices $A=(a_{ij})$ such that $a_{ij}\neq 0$ if $\{i,j\}\in E$ and $a_{ij}=0$ if $\{i,j\}\notin E$. The maximum positive semidefinite…
Expander (Tanner) codes combine sparse graphs with local constraints, enabling linear-time decoding and asymptotically good distance--rate tradeoffs. A standard constraint-counting argument yields the global-rate lower bound $R\ge 2r-1$ for…
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…
In this paper, we introduce RED-NET: A Recursive Encoder-Decoder Network with Skip-Connections for edge detection in natural images. The proposed network is a novel integration of a Recursive Neural Network with an Encoder-Decoder…
Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…
Many NP-hard graph problems become easy for some classes of graphs. For example, coloring is easy for bipartite graphs, but NP-hard in general. So we can ask question like when does a hard problem become easy? What is the minimum…
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…
Data partitioning that maximizes/minimizes the Shannon entropy, or more generally the R\'enyi entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms. These partition algorithms can be…
We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…
In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
Motivated by the theory of spin-glasses in physics, we study the so-called reconstruction problem for the related distributions on the tree, and on the sparse random graph $G(n,d/n)$. Both cases, reduce naturally to studying broadcasting…
We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $\kappa_x(n) = n^x + \sum_{d\lfloor n} \kappa_x(d)$, where the sum is over the proper divisors of $n$. We give a geometrical…
We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…
Relations between Shannon entropy and Renyi entropies of integer order are discussed. For any N-point discrete probability distribution for which the Renyi entropies of order two and three are known, we provide an lower and an upper bound…