Zobrazeno 1 - 10
of 72
pro vyhledávání: '"I. Borosh"'
Publikováno v:
Information Security and Privacy ISBN: 9783540677420
ACISP
ACISP
Blakley and Borosh introduced a general theory of codes, encompassing cryptographic and error control codes among others. They explored the properties of such general codes with methods from relational algebra and set theory. We provide a categorical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a194600a79b5a7e9f752ad1dbd1e6f86
https://doi.org/10.1007/10718964_22
https://doi.org/10.1007/10718964_22
Autor:
I. Borosh, G. R. Blakley
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540643821
ISW
ISW
When two competing paradigms bear on a single area of study, investigators have more choices at their disposal. This is not always an advantage.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cbf7715244c84cf046467b08b31400b
https://doi.org/10.1007/bfb0030405
https://doi.org/10.1007/bfb0030405
Autor:
I Borosh, G.R Blakley
Publikováno v:
Advances in Mathematics. 34(2):109-136
From time to time the sizes of things outrun convenient description in terms of the commonplace mathematical notations of the day. In the Sand Reckoner (Y$.+LT~u) Archimedes took some pains to describe in words a number Y which exceeded the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c04c80ef8e0000da288f516dd9ac2a08
Publikováno v:
Discrete Mathematics. 58(3):215-220
Let Ax = B be a system of m × n linear equations with integer coefficients. Assume the rows of A are linearly independent and denote by X (respectively Y ) the maximum of the absolute values of the m × m minors of the matrix A (the augmented matrix
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ae9e9030cdec04737ac0e2790947ea7
Publikováno v:
Analysis Mathematica. 4:3-12
Доказана теорема. Пус ть {аn} — последовате льность положительн ых чисел, монотонно стре мящаяся к нулю, причем Σan=∞. Тогда найд ется така
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::551161d932392a1bff3345299cb6ae89
https://doi.org/10.1007/bf01904853
https://doi.org/10.1007/bf01904853
Publikováno v:
Journal of Approximation Theory. 24:227-235
where iIfIIm = sup{]f(x)l : 0 < x < 1:. For example, p,& = 2P+‘T, , where T,(x) = cos(n cos-l x) are the Chebyshev polynomials. It is easy to verify that not all the coefficients of p,*,, are bounded as IZ tends to infinity. In fact, the “middle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::097f2a404ebecaf4475c8b054cd94c7c
https://doi.org/10.1016/0021-9045(78)90027-8
https://doi.org/10.1016/0021-9045(78)90027-8
Publikováno v:
Linear and Multilinear Algebra. 3:255-258
This paper provides a counterexample to three questions posed by Richman and Schneider in a recent paper concerning primes in the semigroup Nn of n×n nonnegative matrices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54b3f10d2d04e83a89c61bb64fb6023e
https://doi.org/10.1080/03081087608817117
https://doi.org/10.1080/03081087608817117
Autor:
I. Borosh, G.R. Blakley
Publikováno v:
Computers & Mathematics with Applications. 9(4):567-581
To give examples of large combinatorial problems D. Knuth modified W. Ackermann's example of a recursive, but not primitive recursive, function to produce a class of nonassociative compositions. These arrow compositions, which we call krata, are defi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6104474f63426e471606735a82a383c
Autor:
I. Borosh, A. S. Fraenkel
Publikováno v:
Transactions of the American Mathematical Society. 211:23-38
Let s be a positive integer, c > 1 , μ 0 , … , μ s c > 1,{\mu _0}, \ldots ,{\mu _s} reals in [0, 1], σ = Σ i = 0 s μ i \sigma = \Sigma _{i = 0}^s\;{\mu _i} , and t the number of nonzero μ i {\mu _i} . Let Π i ( i = 0 , … , s ) {\Pi _i}\;(i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55d78c03c72e9136ac9ae9787016616b
https://doi.org/10.1090/s0002-9947-1975-0376591-6
https://doi.org/10.1090/s0002-9947-1975-0376591-6
Autor:
I. Borosh, L. B. Treybig
Publikováno v:
Proceedings of the American Mathematical Society. 55:299-304
Assuming the existence of a solution, we find bounds for small solutions x of the finite matrix equation Ax = B, where each entry of A, B is an integer, and x is a nontrivial column vector with nonnegative integer entries. 0. Introduction. In [1], [5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cda07ad65e1287930c685b767bd44345
https://doi.org/10.1090/s0002-9939-1976-0396605-3
https://doi.org/10.1090/s0002-9939-1976-0396605-3