In this paper we develop a combinatorial method for the evaluation of yield of fault-tolerant systems-on-chip. The method assumes that defects are produced according to a model in which defects are lethal and affect given ...

The Erdős-Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k− 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...

The work builds on the method of sequences of independent subsets, which allows finding an upper bound for the information rate for a specific scheme. To calculate this upper bound, it is necessary to find a lower bound ...

Bipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—eigenvalues of its adjacency matrix—are symmetric about zero, as the corresponding eigenvectors come into pairs. Moreover, ...

In this paper, we develop a combinatorial method for the evaluation of the functional yield of defect-tolerant systems-on chip (SoC). The method assumes that random manufacturing defects are produced according to a model ...

To an arc A of PG(k-1,q) of size q+k-1-t we associate a tensor in ¿¿k,t(A)¿¿k-1 , where ¿k,t denotes the Veronese map of degree t defined on PG(k-1,q) . As a corollary we prove that for each arc A in PG(k-1,q) of size ...

Bousquet-Mélou i Schaeffer donaren el 2000 una enumeració bijectiva de certs mapes anomenats constel·lacions. El 2019, Lepoutre va descriure una bijecció entre mapes biacoloribles de gènere arbitrari i certs mapes unicel·lulars ...

This paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially? If so, what ...

For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower ...