Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
On an inequality of Hardy, Littlewood and Polya / / A.J. Hoffman
| On an inequality of Hardy, Littlewood and Polya / / A.J. Hoffman |
| Autore | Hoffman A. J (Alan Jerome), <1924-> |
| Pubbl/distr/stampa | Gaithersburg, MD : , : U.S. Dept. of Commerce, National Institute of Standards and Technology, , 1953 |
| Descrizione fisica | 1 online resource |
| Altri autori (Persone) | HoffmanA. J <1924-> (Alan Jerome) |
| Collana | NBS report |
| Soggetto topico | Inequalities (Mathematics) |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910711135003321 |
Hoffman A. J (Alan Jerome), <1924->
|
||
| Gaithersburg, MD : , : U.S. Dept. of Commerce, National Institute of Standards and Technology, , 1953 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Selected papers of Alan Hoffman with commentary [[electronic resource] /] / edited by Charles Micchelli
| Selected papers of Alan Hoffman with commentary [[electronic resource] /] / edited by Charles Micchelli |
| Autore | Hoffman A. J (Alan Jerome), <1924-> |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2003 |
| Descrizione fisica | 1 online resource (xliv, 446 p. ) : ill |
| Disciplina | 511/.6 |
| Altri autori (Persone) | MicchelliCharles A |
| Soggetto topico |
Combinatorial analysis
Programming (Mathematics) |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-94808-X
9786611948085 981-279-693-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Geometry. On the foundations of inversion geometry -- Cyclic affine planes -- On the number of absolute points of a correlation / with M. Newman, E.G. Straus and O. Taussky -- On unions and intersections of cones -- Binding constraints and Helly numbers -- Combinatorics. A characterization of comparability graphs and of interval graphs / with P.C. Gilmore -- Some properties of graphs with multiple edges / with D.R. Fulkerson and M.H. McAndrew -- Self-orthogonal Latin squares / R.K. Brayton and Don Coppersmith -- On partitions of a partially ordered set / with D.E. Schwartz -- Variations on a theorem of Ryser / with Dasong Cao, V. Chvátal and A. Vince -- Matrix inequalities and eigenvalues. The variation of the spectrum of a normal matrix / with H.W. Wielandt -- Some metric inequalities in the space of matrices / with Ky Fan -- On the nonsingularity of complex matrices / with Paul Camion -- Combinatorial aspects of Gerschgorin's theorem -- Linear G-functions -- On the relationship between the Hausdorff distance and matrix distances of ellipsoids / with Jean-Louis Goffin -- Bounds for the spectrum of normal matrices / with E.R. Barnes -- Linear inequalities and linear programming. On approximate solutions of systems of linear inequalities -- Cycling in the simplex algorithm -- Computational experience in solving linear programs / with M. Mannos, D. Sokolowsky and N. Wiegmann -- On abstract dual linear programs -- A proof of the convexity of the range of a nonatomic vector measure using linear inequalities / with Uriel G. Rothblum -- A nonlinear allocation problem / with E.V. Denardo, T. Mackenzie and W.R. Pulleyblank.
Combinatorial optimization. Integral boundary points of convex polyhedra / with J.B. Kruska -- Some recent applications of the theory of linear inequalities to extremal combinatorial analysis -- Finding all shortest distances in a directed network / with S. Winograd -- On balanced matrices / with D.R. Fulkerson and Rosa Oppenheim -- A generalization of max flow-min cut -- On lattice polyhedra III: blockers and anti-blockers of lattice clutters -- Local unimodularity in the matching polytope / with Rosa Oppenheim -- A fast algorithm that makes matrices optimally sparse / with S. Thomas McCormick -- Greedy algorithms. On simple linear programming problems -- Totally balanced and greedy matrices / with A.W.J. Kolen and M. Sakarovitch -- Greedy packing and series-parallel graphs / with Alan C. Tucker -- On simple combinatorial optimization problems -- Series parallel composition of greedy linear programming problems / with Wolfgang W. Bein and Peter Brucker -- Graph spectra. On the uniqueness of the triangular association scheme -- On Moore graphs with diameters 2 and 3 / with R.R. Singleton -- On the polynomial of a graph -- On the line graph of a symmetric balanced incomplete block design / with D.K. Ray-Chaudhuri -- On eigenvalues and colorings of graphs -- eigenvalues and partitionings of the edges of a graph -- On spectrally bounded graphs -- Lower bounds for the partitioning of graphs / with W.E. Donath -- Nearest S-matrices of given rank and the Ramsey problem for eigenvalues of bipartite S-graphs / with Peter Joffe. |
| Record Nr. | UNINA-9910453171203321 |
|
Hoffman A. J (Alan Jerome), <1924->
|
||
| River Edge, N.J., : World Scientific, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Selected papers of Alan Hoffman with commentary [[electronic resource] /] / edited by Charles Micchelli
| Selected papers of Alan Hoffman with commentary [[electronic resource] /] / edited by Charles Micchelli |
| Autore | Hoffman A. J (Alan Jerome), <1924-> |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2003 |
| Descrizione fisica | 1 online resource (xliv, 446 p. ) : ill |
| Disciplina | 511/.6 |
| Altri autori (Persone) | MicchelliCharles A |
| Soggetto topico |
Combinatorial analysis
Programming (Mathematics) |
| ISBN |
1-281-94808-X
9786611948085 981-279-693-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Geometry. On the foundations of inversion geometry -- Cyclic affine planes -- On the number of absolute points of a correlation / with M. Newman, E.G. Straus and O. Taussky -- On unions and intersections of cones -- Binding constraints and Helly numbers -- Combinatorics. A characterization of comparability graphs and of interval graphs / with P.C. Gilmore -- Some properties of graphs with multiple edges / with D.R. Fulkerson and M.H. McAndrew -- Self-orthogonal Latin squares / R.K. Brayton and Don Coppersmith -- On partitions of a partially ordered set / with D.E. Schwartz -- Variations on a theorem of Ryser / with Dasong Cao, V. Chvátal and A. Vince -- Matrix inequalities and eigenvalues. The variation of the spectrum of a normal matrix / with H.W. Wielandt -- Some metric inequalities in the space of matrices / with Ky Fan -- On the nonsingularity of complex matrices / with Paul Camion -- Combinatorial aspects of Gerschgorin's theorem -- Linear G-functions -- On the relationship between the Hausdorff distance and matrix distances of ellipsoids / with Jean-Louis Goffin -- Bounds for the spectrum of normal matrices / with E.R. Barnes -- Linear inequalities and linear programming. On approximate solutions of systems of linear inequalities -- Cycling in the simplex algorithm -- Computational experience in solving linear programs / with M. Mannos, D. Sokolowsky and N. Wiegmann -- On abstract dual linear programs -- A proof of the convexity of the range of a nonatomic vector measure using linear inequalities / with Uriel G. Rothblum -- A nonlinear allocation problem / with E.V. Denardo, T. Mackenzie and W.R. Pulleyblank.
Combinatorial optimization. Integral boundary points of convex polyhedra / with J.B. Kruska -- Some recent applications of the theory of linear inequalities to extremal combinatorial analysis -- Finding all shortest distances in a directed network / with S. Winograd -- On balanced matrices / with D.R. Fulkerson and Rosa Oppenheim -- A generalization of max flow-min cut -- On lattice polyhedra III: blockers and anti-blockers of lattice clutters -- Local unimodularity in the matching polytope / with Rosa Oppenheim -- A fast algorithm that makes matrices optimally sparse / with S. Thomas McCormick -- Greedy algorithms. On simple linear programming problems -- Totally balanced and greedy matrices / with A.W.J. Kolen and M. Sakarovitch -- Greedy packing and series-parallel graphs / with Alan C. Tucker -- On simple combinatorial optimization problems -- Series parallel composition of greedy linear programming problems / with Wolfgang W. Bein and Peter Brucker -- Graph spectra. On the uniqueness of the triangular association scheme -- On Moore graphs with diameters 2 and 3 / with R.R. Singleton -- On the polynomial of a graph -- On the line graph of a symmetric balanced incomplete block design / with D.K. Ray-Chaudhuri -- On eigenvalues and colorings of graphs -- eigenvalues and partitionings of the edges of a graph -- On spectrally bounded graphs -- Lower bounds for the partitioning of graphs / with W.E. Donath -- Nearest S-matrices of given rank and the Ramsey problem for eigenvalues of bipartite S-graphs / with Peter Joffe. |
| Record Nr. | UNINA-9910782274903321 |
|
Hoffman A. J (Alan Jerome), <1924->
|
||
| River Edge, N.J., : World Scientific, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Selected papers of Alan Hoffman with commentary / / edited by Charles Micchelli
| Selected papers of Alan Hoffman with commentary / / edited by Charles Micchelli |
| Autore | Hoffman A. J (Alan Jerome), <1924-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | River Edge, N.J., : World Scientific, c2003 |
| Descrizione fisica | 1 online resource (xliv, 446 p. ) : ill |
| Disciplina | 511/.6 |
| Altri autori (Persone) | MicchelliCharles A |
| Soggetto topico |
Combinatorial analysis
Programming (Mathematics) |
| ISBN |
1-281-94808-X
9786611948085 981-279-693-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Geometry. On the foundations of inversion geometry -- Cyclic affine planes -- On the number of absolute points of a correlation / with M. Newman, E.G. Straus and O. Taussky -- On unions and intersections of cones -- Binding constraints and Helly numbers -- Combinatorics. A characterization of comparability graphs and of interval graphs / with P.C. Gilmore -- Some properties of graphs with multiple edges / with D.R. Fulkerson and M.H. McAndrew -- Self-orthogonal Latin squares / R.K. Brayton and Don Coppersmith -- On partitions of a partially ordered set / with D.E. Schwartz -- Variations on a theorem of Ryser / with Dasong Cao, V. Chvátal and A. Vince -- Matrix inequalities and eigenvalues. The variation of the spectrum of a normal matrix / with H.W. Wielandt -- Some metric inequalities in the space of matrices / with Ky Fan -- On the nonsingularity of complex matrices / with Paul Camion -- Combinatorial aspects of Gerschgorin's theorem -- Linear G-functions -- On the relationship between the Hausdorff distance and matrix distances of ellipsoids / with Jean-Louis Goffin -- Bounds for the spectrum of normal matrices / with E.R. Barnes -- Linear inequalities and linear programming. On approximate solutions of systems of linear inequalities -- Cycling in the simplex algorithm -- Computational experience in solving linear programs / with M. Mannos, D. Sokolowsky and N. Wiegmann -- On abstract dual linear programs -- A proof of the convexity of the range of a nonatomic vector measure using linear inequalities / with Uriel G. Rothblum -- A nonlinear allocation problem / with E.V. Denardo, T. Mackenzie and W.R. Pulleyblank.
Combinatorial optimization. Integral boundary points of convex polyhedra / with J.B. Kruska -- Some recent applications of the theory of linear inequalities to extremal combinatorial analysis -- Finding all shortest distances in a directed network / with S. Winograd -- On balanced matrices / with D.R. Fulkerson and Rosa Oppenheim -- A generalization of max flow-min cut -- On lattice polyhedra III: blockers and anti-blockers of lattice clutters -- Local unimodularity in the matching polytope / with Rosa Oppenheim -- A fast algorithm that makes matrices optimally sparse / with S. Thomas McCormick -- Greedy algorithms. On simple linear programming problems -- Totally balanced and greedy matrices / with A.W.J. Kolen and M. Sakarovitch -- Greedy packing and series-parallel graphs / with Alan C. Tucker -- On simple combinatorial optimization problems -- Series parallel composition of greedy linear programming problems / with Wolfgang W. Bein and Peter Brucker -- Graph spectra. On the uniqueness of the triangular association scheme -- On Moore graphs with diameters 2 and 3 / with R.R. Singleton -- On the polynomial of a graph -- On the line graph of a symmetric balanced incomplete block design / with D.K. Ray-Chaudhuri -- On eigenvalues and colorings of graphs -- eigenvalues and partitionings of the edges of a graph -- On spectrally bounded graphs -- Lower bounds for the partitioning of graphs / with W.E. Donath -- Nearest S-matrices of given rank and the Ramsey problem for eigenvalues of bipartite S-graphs / with Peter Joffe. |
| Record Nr. | UNINA-9910817320203321 |
|
Hoffman A. J (Alan Jerome), <1924->
|
||
| River Edge, N.J., : World Scientific, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||