𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Families of arcs disconnected by finite sets I

✍ Scribed by M. Rochowski


Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
140 KB
Volume
66
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


By M. ROCHOWSKI of Katowice (Eingegangen am 5 . 12. 1973) 1. Introduction. I n this paper a generalization (theorem C,) of theorem Ci proved in [3] shall be formulated and as a consequence of it we prove MENOER'S n-Beinsatz (see [l], [2], [4]). The proof of theorem C, shall be published separately in a forthcoming paper of this journal. Let A , B denote two disjoint sets such that c a r d A , c a r d B z n + l , 1 i n < m , If F denote a family of sets, then by U F we denote the union of the sets of the family. Let F,(A, B ) denote a family of arcs which satisfies the following conditions: a,) every arc ab E F,(A, B ) has exactly the end points a, b in common with A U B, a n d a E A , b E B , b,J if an arc ub is contained in U F,,(A, B ) and has exactly the end points a, b in common with A U B, then ab E F,(A, B ) , c,) for every different n points a L , . . . , a,L E A resp. bl, . . . , b, E B there exist in F,L(A, B ) n disjoint arcs with the end points a , , . . . , a, resp. bl, . . . , b,, d,) among every n + 1 arcs of F,(A, B ) at least two have a point in common.

Then we have the following


πŸ“œ SIMILAR VOLUMES


Effective Enumerations of Families of Fi
✍ Angel V. Ditchev πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 301 KB

We construct a universal r.e. set in the following manner: For any (n, x) we construct a set Un,, E 8 such that the set of all (z, n, x ) such that z E U,,,, is r.e. We construct the set Un,x by steps, and on step s we build a finite approximation U,,.x,s of U,,,,, and finally we take Let us describ

Families of Finite Sets in which No Inte
✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 216 KB

In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (

Moving finite element methods by use of
✍ Peter Hansbo πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 494 KB πŸ‘ 1 views

This article deals with moving finite element methods by use of the time-discontinuous Galerkin formulation in combination with oriented space-time meshes. A principle for mesh orientation in space-time based on minimization of the residual, related to adaptive error control via an a posteriori erro