Einloggen

Thematische Bibliographien / Moebius function

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Moebius function“

Autor: Grafiati

Veröffentlicht am 25. Juni 2021

Zuletzt aktualisiert am 11. März 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Moebius function" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Moebius function"

1

Sinai, Ya G. „Statistical properties of the Moebius function“. Automation and Remote Control 74, Nr. 10 (Oktober 2013): 1607–13. http://dx.doi.org/10.1134/s0005117913100019.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Ramaré, Olivier. „Explicit estimates on several summatory functions involving the Moebius function“. Mathematics of Computation 84, Nr. 293 (01.12.2014): 1359–87. http://dx.doi.org/10.1090/s0025-5718-2014-02914-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Ramaré, Olivier. „Corrigendum to Explicit estimates on several summatory functions involving the Moebius function“. Mathematics of Computation 88, Nr. 319 (29.03.2019): 2383–88. http://dx.doi.org/10.1090/mcom/3449.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Bourgain, J. „On the Fourier-Walsh spectrum of the Moebius function“. Israel Journal of Mathematics 197, Nr. 1 (12.02.2013): 215–35. http://dx.doi.org/10.1007/s11856-013-0002-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Grangé, Marcel. „Special Periodic Even Functions“. Moroccan Journal of Pure and Applied Analysis 4, Nr. 1 (01.06.2018): 17–32. http://dx.doi.org/10.1515/mjpaa-2018-0003.

Der volle Inhalt der Quelle

Annotation:

AbstractIn this paper the periodic even functions for which all the regular Riemann sums vanishe are called special periodic even functions. A construction of some of them is put forward, this one rest on the Fourier serie and H. Davenport’s estimations concerning the Moebius function. The special periodic even functions seem linked to the number theory, as this can be seen on the Fourier serie result, on the proposed constructions and on the proof that such functions cannot belong to the Wiener algebra.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Bourgain, Jean. „On the Fourier-Walsh spectrum of the Moebius function, II“. Journal d'Analyse Mathématique 128, Nr. 1 (Februar 2016): 355–67. http://dx.doi.org/10.1007/s11854-016-0012-1.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Ramaré, Olivier. „Some elementary explicit bounds for two mollifications of the Moebius function“. Functiones et Approximatio Commentarii Mathematici 49, Nr. 2 (Dezember 2013): 229–40. http://dx.doi.org/10.7169/facm/2013.49.2.3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Arazy, Jonathan, und Miroslav Engliš. „Qp-spaces on bounded symmetric domains“. Journal of Function Spaces and Applications 6, Nr. 3 (2008): 205–40. http://dx.doi.org/10.1155/2008/342050.

Der volle Inhalt der Quelle

Annotation:

We generalize the theory ofQpspaces, introduced on the unit disc in 1995 by Aulaskari, Xiao and Zhao, to bounded symmetric domains inCd, as well as to analogous Moebius-invariant function spaces and Bloch spaces defined using higher order derivatives; the latter generalization contains new results even in the original context of the unit disc.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Hotton, Matthew, Esme Huggons, Claire Hamlet, Kathleen Bogart, David Johnson, Jonathan H. Norris, Sarah Kilcoyne und Louise Dalton. „A Systematic Review of the Psychosocial Adjustment of Children and Adolescents with Facial Palsy: The Impact of Moebius Syndrome“. International Journal of Environmental Research and Public Health 17, Nr. 15 (30.07.2020): 5528. http://dx.doi.org/10.3390/ijerph17155528.

Der volle Inhalt der Quelle

Annotation:

Introduction: Facial palsy is often associated with impaired facial function and altered appearance. However, the literature with regards to the psychological adjustment of children and adolescents with facial palsy has not been systematically reviewed to date. This paper aimed to review all published research with regards to psychosocial adjustment for children and adolescents with facial palsy. Methods: MEDLINE, CINAHL, Embase, PsychInfo and AMED databases were searched and data was extracted with regards to participant characteristics, study methodology, outcome measures used, psychosocial adjustment and study quality. Results: Five studies were eligible for inclusion, all of which investigated psychosocial adjustment in participants with Moebius syndrome, a form of congenital facial palsy. Many parents reported their children to have greater social difficulties than general population norms, with difficulties potentially increasing with age. Other areas of psychosocial adjustment, including behaviour, anxiety and depression, were found to be more comparable to the general population. Discussion: Children and adolescents with Moebius syndrome may experience social difficulties. However, they also demonstrate areas of resilience. Further research including individuals with facial palsy of other aetiologies is required in order to determine the psychosocial adjustment of children and adolescents with facial palsy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

De Pellegrin, Maurizio, Lorenzo Marcucci, Lorenzo Brogioni und Giovanni Prati. „Surgical Treatment of Clubfoot in Children with Moebius Syndrome“. Children 8, Nr. 4 (19.04.2021): 310. http://dx.doi.org/10.3390/children8040310.

Der volle Inhalt der Quelle

Annotation:

Moebius syndrome (MS) is a rare disease, with paralysis of the VI and VII cranial nerves, frequently associated with clubfoot (CF). The aim of this study was to evaluate surgical treatment of CF in MS, providing its peculiarities. Between 1990 and 2019, we collected data of 11 MS patients with unilateral (n = 5) or bilateral (n = 6) CF, for a total of 17 feet (9R,8L). Six patients (3M,3F) for a total of 10 feet (6R,4L) were treated elsewhere, performing first surgery at an average age of nine months, and in our hospital for relapse surgery at an average age of 4.5 years (Group 1). Five patients (3M, 2F), for a total of seven feet (3R,4L), were primarily treated in our hospital with a peritalar release according to McKay at an average age of 9.4 months (Group 2). Diméglio score was used to assess CF severity. Three questionnaires were submitted for evaluation of subjective and functional results: American Orthopedics Foot and Ankle Society for Hindfoot (AOFAS), Foot and Ankle Outcome Score (FAOS), and Foot and Ankle Ability Measure (FAAM). Average AOFAS/FAOS/FAMM scores were 82.8, 84.8, and 82.3 for Group 1, and 93.2, 94.7, and 95.1 for Group 2 at an average follow-up of 16.9 and 13.3 years, respectively. The average Diméglio score improved from 15.5 to 4.8 in the long-term follow-up in Group 1 and from 14.6 to 3.8 in Group 2. The comparison between the groups showed better results for AOFAS, FAOS, and FAAM scores for Group 2, particularly for pain, function, and foot alignment and for the post-surgical Diméglio score. CF in MS is more severe and presented a higher relapse rate (58.8%) than idiopathic CF. Peritalar release showed no relapse and better subjective and functional results in the long-term follow-up compared to other surgical techniques

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Moebius function"

1

Hokamp, Samuel A. „Weak*-Closed Unitarily and Moebius Invariant Spaces of Bounded Measurable Functions on a Sphere“. Bowling Green State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1562943150719334.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Colombo, Valentina. „SOME PROPERTIES OF THE MOEBIUS FUNCTION IN THE SUBGROUP LATTICE OF THE ALTERNATING AND SYMMETRIC GROUPS“. Doctoral thesis, Università degli studi di Padova, 2010. http://hdl.handle.net/11577/3426937.

Der volle Inhalt der Quelle

Annotation:

We investigate some properties of the Moebius function on the subgroup lattice of the Alternating and Symmetric groups of degree n, Alt(n) and Sym(n). The study of this function is strictly related to the study of the probabilistic zeta function of a finite or profinite group. We obtain results on two different open questions. First we prove that in all the Alternating and Symmetric groups the Moebius number of each subgroup can be bounded polinomially in terms of its index and the number of subgroups with a given index n and non trivial Moebius number grows at most polynomially in n. This result is an important step in order to prove a conjecture of A.Mann on the absolute convergency of the probabilistic series associated to a positively finitely generated profinite group. Then we consider a problem introduced by A.Mann and N.Boston: they conjectured that the existence, for a fixed value of n, of a good correspondence between the maximal subgroups of Alt(n) and Sym(n) reflects the equality between the probabilistic series of Sym(n) and the probabilistic series of the direct product of Alt(n) with a cyclic group of order 2. We prove that this conjecture holds whenever n is a prime; but it does not hold in general (for example when n=21). Even if there exists a one-to-one correspondence between maximal subgroups of Alt(n) and Sym(n) the conjecture can fail; it is the case of n=62.
In questa tesi analizziamo alcune proprietà della funzione di Moebius nel reticolo dei sottogruppi dei gruppi Alterno e Simmetrico di grado n, Alt(n) and Sym(n). Lo studio di questa funzione è strettamente correlato allo studio della funzione zeta probabilistica di un gruppo finito o profinito. Otteniamo risultati riguardanti due problemi distinti. Innanzitutto dimostriamo che in ogni gruppo Alterno o Simmetrico il numero di Moebius di ogni sottogruppo può essere limitato polinomialmente nell'indice di tale sottogruppo, ed il numero di sottogruppi con un dato indice n e con numero di Moebius non nullo cresce al più polinomialmente in n. Questo risultato è un passo importante al fine di dimostrare la validità di una congettura di A.Mann riguardante la convergenza assoluta della serie probabilistica associata ad un gruppo profinito positivamente finitamente generato. In secondo luogo consideriamo un altro problema: A.Mann e N.Boston hanno congetturato che l'esistenza, per un dato valore di n, di una buona corrispondenza tra i sottogruppi massimali di Alt(n) and Sym(n) rifletta l'uguaglianza tra la serie probabilistica di Sym(n) e la serie probabilistica del prodotto diretto fra Alt(n) ed un gruppo ciclico di ordine 2. Proviamo che tale congettura vale se n è primo; ma non è vera in generale (ad esempio quando n=21). Persino se si assume l'esistenza di una corrispondenza biunivoca fra i massimali di Alt(n) e Sym(n), la congettura può non valere; è ciò che accade quando n=62.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2003. http://hdl.handle.net/11572/311140.

Der volle Inhalt der Quelle

Annotation:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Der volle Inhalt der Quelle

Annotation:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science,biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Cervetti, Matteo. „Pattern posets: enumerative, algebraic and algorithmic issues“. Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.

Der volle Inhalt der Quelle

Annotation:

The study of patterns in combinatorial structures has grown up in the past few decades to one of the most active trends of research in combinatorics. Historically, the study of permutations which are constrained by not containing subsequences ordered in various prescribed ways has been motivated by the problem of sorting permutations with certain devices. However, the richness of this notion became especially evident from its plentiful appearances in several very different disciplines, such as pure mathematics, mathematical physics, computer science, biology, and many others. In the last decades, similar notions of patterns have been considered on discrete structures other than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative results obtained in my PhD thesis about patterns in permutations, lattice paths and matchings. In particular I will describe a generating tree with a single label for permutations avoiding the vincular pattern 1 - 32 - 4, a finite automata approach to enumerate lattice excursions avoiding a single pattern and some results about matchings avoiding juxtapositions and liftings of patterns.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Moebius function"

1

Ramaré, Olivier. „Chowla’s Conjecture: From the Liouville Function to the Moebius Function“. In Lecture Notes in Mathematics, 317–23. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74908-2_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

„Moebius-Invariant Function Spaces“. In Function Theory in the Unit Ball of ℂn, 278–87. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-3-540-68276-9_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Gardner, Colin. „‘Stratigraphic Silence’: Chaoid Cinema and its Centripetal/Centrifugal Functions“. In Chaoid Cinema, 1–21. Edinburgh University Press, 2021. http://dx.doi.org/10.3366/edinburgh/9781474494021.003.0001.

Der volle Inhalt der Quelle

Annotation:

The Introduction lays down the philosophical basis for the book by showing how silence acts as a connecting vector between different planes – specifically composition (art) and immanence (philosophy) – using a stratigraphic approach derived from Deleuze and Guattari, whereby layers of meaning are less chronological than they are overlapping (like rock strata) so that we can make ‘underground’ connections beneath the surface continuity of the narrative. Then, using Laura U. Marks’s concept of ‘enfolding-unfolding aesthetics’ (itself grounded in Leibniz’s baroque fold as the smallest element of matter), the chapter shows how the past-as-virtual unfolds and then re-enfolds back in relation to the actual along the plane of immanence, linking experience, information and image in a topological biogram (akin to an endlessly returning Moebius strip). This is then related to centripetal and centrifugal forces in traditional film theory, whether based on the rigid framing of the theatrical proscenium (André Bazin’s centripetally independent shot, epitomized by the long take) or the deframings of Eisenstein and other montage-oriented directors where movement across and between shots breaks the theatrical frame (Deleuze’s movement-image).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Moebius function"

1

Murakami, Yuko. „The one-loop analysis of the beta-function in the Schroedinger Functional for Moebius Domain Wall Fermions“. In The 33rd International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2016. http://dx.doi.org/10.22323/1.251.0308.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Lampka, K., S. Harwarth, und M. Siegle. „Can matrix-layout-independent numerical solvers be efficient?: implementing the Moebius state-level abstract functional interface for ZDDs“. In 2nd International ICST Conference on Performance Evaluation Methodologies and Tools. ICST, 2007. http://dx.doi.org/10.4108/smctools.2007.1918.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!