Results 51 to 60 of about 2,909 (193)

Tiling a Rectangle with Polyominoes [PDF]

Discrete Mathematics & Theoretical Computer Science, 2003
A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj   +1 more source

International Journal of Mathematical Combinatorics, Vol.4 [PDF]

, 2010
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source

Analysis of an algorithm catching elephants on the Internet [PDF]

Discrete Mathematics & Theoretical Computer Science, 2008
The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub, Christine Fricker, Frédéric Meunier, Danielle Tibi   +3 more
doaj   +1 more source

Exact Values and Bounds on Covering Schemes of Strength Two

Journal of Combinatorial Designs, EarlyView.
ABSTRACT In this work, we investigate covering schemes of strength 2 over finite abelian groups, establishing new lower and upper bounds and evaluating new exact values. A main result is a new general lower bound that improves the trivial one and achieves optimality for the binary case. We also develop a recursive relation based on subsets of the group
André G. Castoldi, Anderson N. Martinhão, Emerson L. Monte Carmelo, Pablo H. Perondi, Otávio J. N. T. N. dos Santos   +4 more
wiley   +1 more source

Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]

, 2004
Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna, Welzl, Emo, Jens Stoye, Stoye, Jens, Erlebach, Thomas, Stoye, Jens ; https://orcid.org/, Mark Cieliebak, Thomas Erlebach, Emo Welzl, Cieliebak, Mark   +9 more
core   +1 more source

Mixed Powers of Generating Functions [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
Given an integer $m \geq 1$, let $\| \cdot \|$ be a norm in $\mathbb{R}^{m+1}$ and let $\mathbb{S}_+^m$ denote the set of points $\mathbf{d}=(d_0,\ldots,d_m)$ in $\mathbb{R}^{m+1}$ with nonnegative coordinates and such that $\| \mathbf{d} \|=1$. Consider
Manuel Lladser
doaj   +1 more source

Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley   +1 more source

Constrained exchangeable partitions [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Alexander Gnedin
doaj   +1 more source

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source