Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Aaron Meyerowitz"'
Autor:
Aaron Meyerowitz
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AA,..., Iss Proceedings (2001)
It is known the one dimensional prototile $0,a,a+b$ and its reflection $0,b,a+b$ always tile some interval. The subject has not received a great deal of further attention, although many interesting questions exist. All the information about tilings c
Externí odkaz:
https://doaj.org/article/786568deda704d4b80f29561bb61cd79
Publikováno v:
Information Processing Letters. 115:899-902
MAC striping intermixes a payload with its authentication tag, placing the bits used for message authentication in positions derived from a secret key. The use of MAC striping has been suggested to authenticate encrypted payloads using short tags. Fo
Autor:
Aaron Meyerowitz, Ethan M. Coven
Publikováno v:
Journal of Algebra. 212(1):161-174
A settiles the integersif and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power siz
Autor:
Aaron Meyerowitz
Publikováno v:
European Journal of Combinatorics. 16(5):491-501
We study maximum cardinality families of pairwise intersecting subsets of an n -set. We give some general results on the collection of all such families for a fixed set and introduce a useful operation of switching which allows us to transform any on
Autor:
John L. Selfridge, Aaron Meyerowitz
Publikováno v:
Integers. 12
Suppose that
Publikováno v:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. :377-389
A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a finite set and let B be a belief function on 2S. Then B induces a density on 2
Publikováno v:
Discrete Mathematics. 94(3):209-219
Every sequence of length n determines (nk) subsequences of length k. We investigate the relationship between such subsequences and the original sequence. In particular, we show that for n>;7 and k⩾[n/2] the subsequences uniquely determine the origi
Autor:
Aaron Meyerowitz, Mark Schwartz
Publikováno v:
Transactions of the American Mathematical Society. 294:287-294
The generalized strong law of large numbers of Komlós may be extended to include certain dominated permutations of the random variables. A further extension to larger classes of permutations is obtained through decompositions of sequences of positiv
Autor:
Aaron Meyerowitz
Publikováno v:
Discrete Mathematics. (1-3):149-165
In a distance-regular graph, the partition with respect to distance from a vertex supports a unique eigenvector for each eigenvalue. There may be non-singleton vertex sets whose corresponding distance partition also supports eigenvectors. We consider
Autor:
Aaron Meyerowitz
Publikováno v:
Journal of Combinatorial Theory, Series A. (1):134-141
We discuss 2-( υ , k , λ ) designs with two intersecion numbers the larger of which is λ. We show that for each λ there are only finitely many feasible parameter sets. We find all parameter sets with λ less than 400 and smaller intersection at l