標(biāo)題: Titlebook: Combinatorial Mathematics V.; Proceedings of the F Charles H. C. Little Conference proceedings 1977 Springer-Verlag Berlin Heidelberg 1977 [打印本頁(yè)] 作者: minuscule 時(shí)間: 2025-3-21 18:23
書目名稱Combinatorial Mathematics V.影響因子(影響力)
作者: 衰老 時(shí)間: 2025-3-21 23:47
Latin squares composed of four disjoint subsquares,作者: Myosin 時(shí)間: 2025-3-22 02:22 作者: prosthesis 時(shí)間: 2025-3-22 06:50
The knotted hexagon,al position in E.) be the set of vertices of some knotted hexagon, it is necessary that the convex hull K of the six points have six vertices (i.e. that no point lie inside the convex hull of the other five) and it is necessary and sufficient that K be of a certain combinatorial type, there being tw作者: colloquial 時(shí)間: 2025-3-22 12:07
Sum-free sets in loops,he converse problem, of finding a sum-free partition and then obtaining the colouring looks like being much harder. Note also that there are still colourings of K. which cannot be obtained in this way. For example, if the colouring shown in Figure 7 were obtainabl from a loop {0,1,2,3,4,5} then thre作者: Between 時(shí)間: 2025-3-22 16:46 作者: Between 時(shí)間: 2025-3-22 17:32
,A schr?der triangle: Three combinatorial problems,. Three combinatorial interpretations of the sequences are given which are variants of interpretations of the Catalan numbers. The method of enumeration used is that of first or last passage decomposition. This leads to a renewal array having many of the properties of Pascal‘s triangle.作者: projectile 時(shí)間: 2025-3-23 01:06
Anne Germain,Rebecca Campbell,Ashlee McKeone elements, say {1,2,3} would have to be in one of the sum-free sets. But then {0,4,5} would, by 3.1, be a subloop, and so neither 0–4 nor 4–0 could belong to {1,2,3}. (However, Heinrich [4] has shown that this colouring can be embedded in a colouring of K. obtained from a sum-free partition of Z.).作者: CLIFF 時(shí)間: 2025-3-23 05:27 作者: RENIN 時(shí)間: 2025-3-23 06:26 作者: tattle 時(shí)間: 2025-3-23 11:28
A problem in the design of electrical circuits, a generalized subadditive inequality and the recurrtion and asymptotic solutions are also found. A second, direct construction gives another upper bound and the two upper bounds are compared, j(n,m) being the better for m small in comparison with n. Problems involving other voting procedures are also considered.作者: 躺下殘殺 時(shí)間: 2025-3-23 15:54 作者: 匍匐前進(jìn) 時(shí)間: 2025-3-23 21:26 作者: Catheter 時(shí)間: 2025-3-24 01:38 作者: 植物群 時(shí)間: 2025-3-24 03:37 作者: 襲擊 時(shí)間: 2025-3-24 10:11
Combinatorial Mathematics V.978-3-540-37020-8Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 發(fā)酵劑 時(shí)間: 2025-3-24 14:39
0075-8434 Overview: 978-3-540-08524-9978-3-540-37020-8Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 相信 時(shí)間: 2025-3-24 17:24 作者: 短程旅游 時(shí)間: 2025-3-24 22:41 作者: 靦腆 時(shí)間: 2025-3-24 23:11
https://doi.org/10.1007/978-94-011-6226-5In . Goethals and Seidel produced a matrix on . variables which has proved invaluable in the construction of orthogonal designs. In this paper the Goethals-Seidel matrix is generalized to construct orthogonal designs of large composite orders. An asymptotic result for . variable orthogonal designs of order ., where . is odd, is obtained.作者: aspersion 時(shí)間: 2025-3-25 06:50
Modelling Sleep and General Anaesthesia,We survey the results obtained by a large number of authors concerning the spectrum of a graph. The questions of characterisation by spectrum, cospectral graphs and information derived from the spectrum are discussed.作者: Orgasm 時(shí)間: 2025-3-25 10:00
https://doi.org/10.1007/978-1-4614-0173-5We prove Grant‘s conjecture that, for all graphs G and H with H ? K., the lexicographic product G[H] is semi-stable at (v, w) if H is semi-stable at w. Thus we can conclude that G[H] is semi-stable at (v, w) if and only if H is semi-stable at w.作者: 細(xì)胞膜 時(shí)間: 2025-3-25 15:07
Sleep Disturbance During Military DeploymentThis paper uses circulant matrices, computer techniques and product designs to construct orthogonal designs in order 24.作者: anachronistic 時(shí)間: 2025-3-25 18:09
Computer-Assisted PolysomnographyLet p be a prime, p=4t?1, t≥2. A construction is given for a balanced incomplete block design with parameters (4t?1, (2t?1)(4t?1), (2t?1)., 2t?1, (2t?1)(t?1)), which contains no (4t?1, 2t?1, t?1) symmetric design.作者: 淘氣 時(shí)間: 2025-3-25 22:27
Some new constructions for orthogonal designs using circulants,In . Goethals and Seidel produced a matrix on . variables which has proved invaluable in the construction of orthogonal designs. In this paper the Goethals-Seidel matrix is generalized to construct orthogonal designs of large composite orders. An asymptotic result for . variable orthogonal designs of order ., where . is odd, is obtained.作者: 忍耐 時(shí)間: 2025-3-26 02:39 作者: Measured 時(shí)間: 2025-3-26 07:23
The semi-stability of lexicographic products,We prove Grant‘s conjecture that, for all graphs G and H with H ? K., the lexicographic product G[H] is semi-stable at (v, w) if H is semi-stable at w. Thus we can conclude that G[H] is semi-stable at (v, w) if and only if H is semi-stable at w.作者: 薄荷醇 時(shí)間: 2025-3-26 10:57 作者: 雄辯 時(shí)間: 2025-3-26 12:37
On quasi-multiple designs,Let p be a prime, p=4t?1, t≥2. A construction is given for a balanced incomplete block design with parameters (4t?1, (2t?1)(4t?1), (2t?1)., 2t?1, (2t?1)(t?1)), which contains no (4t?1, 2t?1, t?1) symmetric design.作者: 嘮叨 時(shí)間: 2025-3-26 18:14
https://doi.org/10.1007/BFb0069176Counting; Kombinatorik; combinatorics; graph; mathematics; theorem作者: 閑逛 時(shí)間: 2025-3-26 23:25 作者: inculpate 時(shí)間: 2025-3-27 04:10 作者: 漂亮才會(huì)豪華 時(shí)間: 2025-3-27 08:30 作者: 疼死我了 時(shí)間: 2025-3-27 12:09
Pharmacological Treatment of Sleep Disordersal position in E.) be the set of vertices of some knotted hexagon, it is necessary that the convex hull K of the six points have six vertices (i.e. that no point lie inside the convex hull of the other five) and it is necessary and sufficient that K be of a certain combinatorial type, there being tw作者: GENUS 時(shí)間: 2025-3-27 15:33
Anne Germain,Rebecca Campbell,Ashlee McKeonhe converse problem, of finding a sum-free partition and then obtaining the colouring looks like being much harder. Note also that there are still colourings of K. which cannot be obtained in this way. For example, if the colouring shown in Figure 7 were obtainabl from a loop {0,1,2,3,4,5} then thre作者: 尖 時(shí)間: 2025-3-27 18:19
Eric Vermetten,Anne Germain,Thomas C. Neylanout of n voters close their switches (vote yes) is discussed. An upper bound j(n,m) for this number is obtained as the maximal solution of a generalized subadditive inequality which is then shown to satisfy the recurrence relation of the title. It is shown how to find explicit solutions of this equa作者: hedonic 時(shí)間: 2025-3-27 22:22 作者: Mets552 時(shí)間: 2025-3-28 02:22
I. Granata,M. R. Guarracino,L. Maddalena,I. Manipur,P. M. Pardaloserfügt als energetisch autarkes und genetisch semi-autonomes System (→ S. 80) über eine Vielzahl biogenetischer Potenzen. Man kann heute die Chloroplasten aus pflanzlichem Gewebe, z. B. aus Bl?ttern, im photosynthetisch voll aktiven Zustand isolieren und die biophysikalischen und biochemischen Teilp作者: jarring 時(shí)間: 2025-3-28 06:48
Aksel Hugo,Elisabeth Iversenrectors and Teachers of Psychopharmacology in Psychiatric Residency Programs in December 2020, as well as continued advances in translational neuroscience and psychopharmacologic practice, it is time to focus on changes in how psychopharmacology is taught (Glick. Model psychopharmacology curriculum 作者: Innovative 時(shí)間: 2025-3-28 13:20 作者: accomplishment 時(shí)間: 2025-3-28 17:52 作者: 無(wú)法治愈 時(shí)間: 2025-3-28 20:12 作者: 分散 時(shí)間: 2025-3-29 00:45 作者: Innovative 時(shí)間: 2025-3-29 03:29 作者: Frequency 時(shí)間: 2025-3-29 10:49 作者: 防銹 時(shí)間: 2025-3-29 14:18
Risk Management for the Family Physiciansistent data. We also propose a proof-of-concept implementation of delta-BPMN by realising the front-end part in Camunda and the back-end in a framework that translates language specifications into the executable code of a state-of-the-art SMT-based model checker.作者: Conflagration 時(shí)間: 2025-3-29 17:01 作者: AVOW 時(shí)間: 2025-3-29 21:48
Andrew J. Gow,Christiana W. Davis,David Munson,Harry Ischiropoulossive use of simulations, with every theory and every result accompanied by a simulation. All simulations are performed by the free and open source Python programming language and the free and open source circuit simulator Python Power Electronics..978-3-031-41407-7978-3-031-41405-3Series ISSN 1931-9525 Series E-ISSN 1931-9533 作者: voluble 時(shí)間: 2025-3-30 03:42
Gregory Kisunko,Stephen Knackuch technology . . . Thereafter, however, the rewards are increasingly achieved by the application of high technology". Although one might argue whether this golden age is really foregone, and discuss the "height" of the technology involved, this quotation is closely related to the main motivations of Part II978-3-7643-5717-7978-3-0348-8954-4作者: CUMB 時(shí)間: 2025-3-30 05:53 作者: Outmoded 時(shí)間: 2025-3-30 12:13
Taking the Map Further with MapOptions,h holds all the settings for the map. You learned that the required MapOptions properties are center, zoom, and mapTypeId. But there are other properties as well that you can use to make the map behave and look the way you want.作者: legacy 時(shí)間: 2025-3-30 13:55
Xiu Zhu Sun,John Nguyen,Jamil Momandlzogen. Rund die H?lfte der in der Industrie erzeugten Bruttowertsch?pfung wird – aufgrund demographisch, sozial und technologisch bedingter Ver?nderungen des Nachfrageverhaltens und infolge steigenden Innovationsdrucks zur Differenzierung im Wettbewerb – durch industrielle Dienstleistungen erbracht作者: 細(xì)胞膜 時(shí)間: 2025-3-30 17:24
