Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the on...

in this work, we investigate the transfer of some homological properties from a ring $r$ to its amalgamated duplication along some ideal $i$ of $r$ $rbowtie i$, and then generate new and original families of rings with these properties.

let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.

In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph [2]. Two conjectures are now known as the Perfect Graph Theorem and the Strong Perfect Graph Theorem. Both of these theorems make deteminin...

the right to live is a common human right, which is essential to every individual human being due to the inherent dignity of the human person. no one is allowed to take this right from another human being, and the transgression of this human law, which is also supported by the transcendent teachings of islam, requires perfect reasons. therefore, in case of uncertainty about whether to sentence ...