A combinatorial approach to evaluation of reliability of the receiver output for BPSK modulation with spatial diversity.
A combinatorial proof of Louck's conjecture.
A distributed transportation simplex applied to a Content Distribution Network problem
A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem...
A Hajós type result on factoring finite abelian groups by subsets. II
It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.
A Loopless Implementation of a Gray Code for Signed Permutations
A note on domination in bipartite graphs
DOMINATING SET remains NP-complete even when instances are restricted to bipartite graphs, however, in this case VERTEX COVER is solvable in polynomial time. Consequences to VECTOR DOMINATING SET as a generalization of both are discussed.
A partially persistent data structure for the set-union problem
A scaling result for explosive processes.
An algorithm to compute the möbius function of the rotation lattice of binary trees
An exact performance bound for an time greedy matching procedure.
An exercise on Fibonacci representations
We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.
An Exercise on Fibonacci Representations
We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.
Asymptotic distributions and chaos for the supermarket model.
Block distribution in random strings
For almost all infinite binary sequences of Bernoulli trials the frequency of blocks of length in the first terms tends asymptotically to the probability of the blocks, if increases like (for ) where tends to . This generalizes a result due to P. Flajolet, P. Kirschenhofer and R.F. Tichy concerning the case .
Clustering in trees: Optimizing cluster sizes and number of subtrees.
Combinatorial properties of one-dimensional arrangements.
Combinatorics of singly-repairable families.
Competitive colorings of oriented graphs.
Counting subwords in a partition of a set.
Cycle and path embedding on 5-ary N-cubes
We study two topological properties of the 5-ary -cube . Given two arbitrary distinct nodes and in , we prove that there exists an - path of every length ranging from to , where . Based on this result, we prove that is 5-edge-pancyclic by showing that every edge in lies on a cycle of every length ranging from to .