| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA990007188920403321 |
|
|
Titolo |
Le partecipazioni statali : atti del Convegno di studi promosso dai gruppi parlamentari della Democrazia Cristiana : Roma, 15 luglio 1980 / a cura di Franco Rizzo |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Napoli : Edizioni Scientifiche Italiane, 1980 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Locazione |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
2. |
Record Nr. |
UNINA9910482676103321 |
|
|
Autore |
Hemmingsen Niels <1513-1600.> |
|
|
Titolo |
Om Ecteskab At 1. Betencke, 2. Begynde, 3. Fuldkomme, 4. Leffue vdi, 1. Vislige, 2. ærlige, 3. Gudfryctige, 4. rolige, En Christelig vndervisning, Niels Hemmingssøn [[electronic resource]] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Copenhagen, : Mads Vingaard, 1572 |
|
|
|
|
|
|
|
Descrizione fisica |
|
Online resource ([10], 423, [23] s.) |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Reproduction of original in Det Kongelige Bibliotek / The Royal Library (Copenhagen). |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNINA9910812583403321 |
|
|
Titolo |
Tel Aviv Topology Conference, Rothenberg festschrift : International Conference on Topology, June 1-5, 1998, Tel Aviv / / Michael Farber, Wolfgang Lück, Shmuel Weinberger, editors |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Providence, Rhode Island : , : American Mathematical Society, , [1999] |
|
©1999 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (334 p.) |
|
|
|
|
|
|
Collana |
|
Contemporary mathematics, , 0271-4132 ; ; 231 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Dedicated to Mel Rothenberg on the occasion of his 65th birthday. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
""Contents""; ""Preface""; ""Vanishing theorems on covering manifolds""; ""1. Introduction""; ""2. L 2 vanishing theorem for the half-kernel of a Dirac operator""; ""3. Complex manifolds. The L 2 analogue of the Andreotti-Grauert theorem""; ""4. Almost complex manifolds. An analogue of the Andreotti-Grauert theorem.""; ""5. Application to the representation theory""; ""6. Proof of the vanishing theorem for the half-kernel of a Dirac operator""; ""7. Proof of the Andreotti-Grauert-type theorem for almost complex manifolds""; ""8. Proof of the L 2 Andreotti-Grauert theorem"" |
""9. The Lichnerowicz formula. Proof of Propositions 6.3 and 7.1""""10. Estimate of the metric Laplacian""; ""References""; ""The Sunada method""; ""Relative torsion for homotopy triangulations""; ""0. Introduction and statements of the results.""; ""1. Operators and complexes and the proof of the first four results.""; ""2. Anomalies for the relative torsion.""; ""3. References.""; ""Non-linear similarity and linear similarity are equivariant below dimension 6""; ""Massey products and critical points""; ""Absolute torsion"" |
""Signatures of links and finite type invariants of cyclic branched covers""""The relation between compact and non-compact equivariant cobordisms""; ""Volume of Riemannian manifolds, geometric inequalities, and homotopy theory""; ""Pure braids, a new subgroup of the mapping class group and finite-type invariants of 3-manifolds""; |
|
|
|
|
|
|
|
|
|
|
|
|
""1. Introduction""; ""2. Statement of Results""; ""3. Proof of Theorem 1""; ""4. Proof of Proposition 2.1""; ""5. Proof of Theorem 2""; ""6. Proof of Theorems 3 and 4.""; ""7. Proof of Proposition 2.2""; ""8. Proof of Theorem 5""; ""References"" |
""Novikov-Shubin invariants for arbitrary group actions and their positivity""""Differential operator endomorphisms of an Euler-Lagrange complex""; ""1. Introduction""; ""2. First toys""; ""3. More serious models""; ""4. Main results""; ""5. Proofs""; ""6. Applications""; ""K-theory of twisted group C*-algebras and positive scalar curvature""; ""Equivariant orientations and Thorn isomorphisms""; ""1. The fundamental groupoid and categorical definitions""; ""2. Functors to the category of G-spaces over orbits""; ""3. Coherent families of connected covers"" |
|
|
|
|
|
|
4. |
Record Nr. |
UNINA9910682598603321 |
|
|
Titolo |
WALCOM: Algorithms and Computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings / / edited by Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2023.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (398 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 13973 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Computer science - Mathematics |
Discrete mathematics |
Numerical analysis |
Algorithms |
Computer graphics |
Application software |
Theory of Computation |
Discrete Mathematics in Computer Science |
Numerical Analysis |
Design and Analysis of Algorithms |
Computer Graphics |
Computer and Information Systems Applications |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Invited Talks -- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult -- The Family of Fan-planar Graphs -- Computational Geometry -- Minimum Ply Covering of Points with Unit Squares -- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms -- Flipping Plane Spanning Paths -- Away from Each Other -- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree -- Reflective Guarding a Gallery -- Improved and Generalized Algorithms for Burning a Planar Point Set -- On the Longest Flip Sequence to Untangle Segments in the Plane -- String Algorithm.-Inferring Strings from Position Heaps in Linear Time -- Internal Longest Palindrome Queries in Optimal Time -- Finding the Cyclic Covers of a String -- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs -- Optimization -- Better Hardness Results for the Minimum Spanning Tree Congestion Problem -- Energy Efficient Sorting, Selection and Searching -- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs -- k-Transmitter Watchman Routes -- Graph Algorithm -- Splitting Plane Graphs to Outerplanarity -- Certifying Induced Subgraphs in Large Graphs -- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs -- On the Complexity of Distance-d Independent Set Reconfiguration -- On Star-multi-interval Pairwise Compatibility Graphs -- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration -- Parameterized Complexity of Path Set Packing -- Approximation Algorithm -- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput -- Recognizing When a Preference System Is Close to Admitting a Master List -- Groups Burning: Analyzing Spreading Processes in Community-based Networks -- Roman k-domination:Hardness, Approximation and Parameterized Results -- Parameterized Complexity -- On the Parameterized Complexity of Compact Set Packing -- Structural Parameterization of Cluster Deletion -- Parity Permutation Pattern Matching. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity. |
|
|
|
|
|
|
|
| |