نتایج جستجو برای: perfect group

تعداد نتایج: 1021937  

2006
Silvia Pedraza

Americans are immigrants—people whose origins are various but whose destinies made them American. Immigration—voluntary or involuntary—is what created all multiracial and multicultural nations. The United States is a prime example. Sometimes the migrants moved freely from the area of origin to the area of destination. Such was the experience of the European immigrants. Sometimes their movement ...

Journal: :Inf. Process. Lett. 1994
Steven S. Seiden Daniel S. Hirschberg

An ordered minimal perfect hash table is one in which no collisions occur among a prede ned set of keys, no space is unused and the data are placed in the table in order. A new method for creating ordered minimal perfect hash functions is presented. It creates hash functions with representation space requirements closer to the theoretical lower bound than previous methods. The method presented ...

2002
Dorceta E. Taylor

This paper examines the environmental experiences of middle and working class whites and people of color in the United States during the 19 th and 20 th centuries. It examines their activism and how their environmental experiences influenced the kinds of discourses they developed. The paper posits that race, class, and gender had profound effects on people's environmental experiences, and conse...

Journal: :SIAM J. Discrete Math. 1995
Ilan Newman Avi Wigderson

Korner [7] defined the notion of graph-entropy. He used it in [8] to simplify the proof of the Fredman-Komlos lower bound for the family size of perfect hash functions. We use this information theoretic notion to obtain a general method for formula size lower bounds. This method can be applied to low-complexity functions for which the other known general methods ([11, 12, 3] and see also [17] )...

Journal: :Comput. J. 1996
Bohdan S. Majewski Nicholas C. Wormald George Havas Zbigniew J. Czech

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...

Journal: :bulletin of the iranian mathematical society 2012
mohamed chhiti najib mahdou

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.

Journal: :transactions on combinatorics 2015
mohammad reza fander

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.

2014
Ingrid Zhang

We investigate the existence of a group action τ that is homomesic with respect to alignments, a type of statistic in perfect matchings. Homomesy is defined as the consistency of an average, and perfect matchings are defined as the set of all partitions of 1 to 2n into pairs. We take advantage of the bijection between labeled Dyck paths and perfect matchings to investigate to investigate the po...

1997
E. Katz

We use renormalization group methods to derive equations of motion for large scale variables in uid dynamics. The large scale variables are averages of the underlying continuum variables over cubic volumes, and naturally live on a lattice. The resulting lattice dynamics represents a perfect discretization of continuum physics, i.e. grid artifacts are completely eliminated. Perfect equations of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید