A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Research Problems

1980
*
European journal of combinatorics (Print)
*

We studied the above

doi:10.1016/s0195-6698(80)80003-5
fatcat:md7sxipoxvax3l5khwfysmgukm
*problem*, set up a computer program and tried to generalize Massey's algorithm (without any published result) and to attack the following*problems*.*PROBLEM*1.1. ...*PROBLEM*1.3. Consider the same*problems*as in 1.1 and 1.2, but take arbitrary modulus instead of 2. ... The above*problems*were collected by the author during his*research*activity in the last 20 years. ...##
###
Research problems

1963
*
Bulletin of the American Mathematical Society
*

Extend the

doi:10.1090/s0002-9904-1963-10961-1
fatcat:vvfgmrvt3fcuvh35fk7ljyeu5q
*problem*by means of different norms and by considerations of various types of operators in Hubert space. Let Xi and X 2} as before, not commute. ...##
###
Research problems

1962
*
Bulletin of the American Mathematical Society
*

boundary sequence {^o,n}, {^m,o}, can one obtain results for sums of the form S(x, coi, co 2 ) = E W1C02 exp(27rix^m, n /^), m,n and for the generalized sums where the recurrence relations have the form

doi:10.1090/s0002-9904-1962-10736-8
fatcat:lwqianmqhbbczprydj5rkdxfdu
*RESEARCH*... The*problem*can be generalized by considering multidimensional sequences, continuous time, correlation in the r ni and a larger number of strata for g(x). Richard Bellman: Prediction theory. ...##
###
Research problems

1998
*
Discrete Mathematics
*

*Research*Problems1 Discrete Mathematics I92 (1998) [347] [348] [349] [350] [351] The general

*problem*of finding c(m) seems very difficult, Find c(3). References [l] H.-J. Bandelt, V. ...

*Problems*of V. Grishukhm

*Problem*305. It is known that the

*problem*to decide whether if a metric is 11 is NP-complete [l] . ...

##
###
Research problems

1993
*
Discrete Mathematics
*

*Problem*170. (Posed by Hasan K. Alkhatib and Dugan B. Jevtie.) One can show that Rr( k, kz) < R,, ...

*Problem*169. (Posed by Claude Shannon.) Find an optimum uniquely decodable codebook of order T on XLk' for given n >4, k> 1, and T> 1. ...

##
###
Research problems

1954
*
Bulletin of the American Mathematical Society
*

The

doi:10.1090/s0002-9904-1954-09878-6
fatcat:znhjkunnprdaxlhqzneil5qjvq
*problem*is to characterize, by means of intrinsic properties, those continua which are cluster sets in the above sense» Reference: Collingwood and Cartwright, Acta Math. vol. 87 (1952) . ... The*problem*is to characterize those continuous functions <f> in Uîor which (*) may hold (i) for every x on C, (ii) uniformly on C, (iii) in some other norm. (Received August 26, 1954.) ...##
###
Research problems

1957
*
Bulletin of the American Mathematical Society
*

Let G be a group and p a prime. Define H P (G) to be the subgroup of G generated by all the elements of G which do not have order p. Is the following conjecture true:

doi:10.1090/s0002-9904-1957-10108-6
fatcat:awcndgngirg4th6exprmltxzm4
##
###
Research problems

1990
*
Discrete Mathematics
*

See

doi:10.1016/0012-365x(90)90340-n
fatcat:jt3iunzqhjbc3osq554oyp547q
*Problem*118 for definitions. Is it possible for a graph to have two different minimal clique covers so that one satisfies the property given in Condition I and the other does not?*Problem*120. ... There is a geometric question related to*Problems*118 and 119. Let P be a simple lattice polygon in the plane. ...##
###
Research problems

1965
*
Bulletin of the American Mathematical Society
*

Consider the same

doi:10.1090/s0002-9904-1965-11287-3
fatcat:4gavkpynzre6pnoer7i36oopeq
*problems*for the case where (a) W n = X)?-0 Wn-fc, » = 0, 1, • • • , (b) w n = X*/n UkV n /k, n = l, 2, • • • . ... Consider the more general class of*problems*: (a) Let u, v, and w be given respectively on subsets Si, Si, and 5s of the interval [0, oo). ...*Problem*A: Evaluate HP=K4) (1 ~£"""*) for 5> 1, where the product is taken over all primes p congruent to 1 modulo 4. In particular, what is the value of the product for s = 2. ...##
###
Research problems

1995
*
Discrete Mathematics
*

All rights reserved SSDI 0012-365X(94)00182-0 406

doi:10.1016/0012-365x(95)90059-t
fatcat:gtlq5enpp5hxzl5fola5qwaxeq
*Research**problems*/ Discrete Mathematics 138 (1995) 405-411*Problem*215 (BCC1). Total colourings of hypergraphs. Posed by P. Cowling. ... These*problems*were presented at the*Problem*Session held at the conference. The originator of the*problem*is given, where known and different from the proposer. ...*Problem*223 (BCC9). A bijective proof of the The*problem*is to find a bijective proof. Let s(n) be the number of sum-free subsets of { 1 ..... n } (i.e., containing no solution to x+y=z). ...##
###
Research problems

1983
*
Discrete Mathematics
*

With Volume 36 of Discrete Mathematics, a

doi:10.1016/0012-365x(83)90065-1
fatcat:e4752maen5cnzg6ks6nz56jeny
*Research**Problem*Section has been established.*Problems*in this section are intended to be*research*level*problems*rather than standard exercises. ... People wishing to correspond on technical matters concerning a*problem*should write to the correspondent.*Problem*35. Posed ... In another direction we can ask, analogously to*Problem*35, whether there is a single Exptime-complete*problem*from which the Lxptime-completeness of chess, checkers and other games can be deduced easily ...
« Previous

*Showing results 1 — 15 out of 10,164,012 results*