搜索结果：Peter

This survey-style note reviews constructive versions of the Peter--Weyl theorem in the Bishop--Coquand--Spitters line. Its main purpose is to clarify which parts of the classical Peter--Weyl package admit constructive reformulations, which parts survive only in weaker or reorganized form, and which questions still appear to remain open. The term ``constructive'' is used here primarily in the Bishop-style sense, together with the related locale-theoretic and formal-topological developments that occur in the work of Coquand and Spitters. We review the constructive compact-group results of Coquand and Spitters, the later role of almost periodic functions and compact completions, and the interaction with constructive Gelfand representation and locale-theoretic compactness. The guiding theme is that the constructive theory exists, but it is often most naturally expressed not as a literal transcription of the classical theorem in terms of irreducible decompositions alone, but rather through finite-rank approximation, characters, and compactifications attached to functions or groups. For orientation and comparison, we also include an appendix giving a standard classical form of the Peter-

In this work Peter principle (in the hierarchical structure any competent member tends to rise to his level of incompetence) is consistently interpreted as the discrete form of the well-known logistic (Verhulst or Maltusian) equation of the population dynamics. According to such interpretation anti-Peter principle (in the hierarchical structure any incompetent member tends to rise to his level of competence) is formulated too.

In the late sixties the Canadian psychologist Laurence J. Peter advanced an apparently paradoxical principle, named since then after him, which can be summarized as follows: {\it 'Every new member in a hierarchical organization climbs the hierarchy until he/she reaches his/her level of maximum incompetence'}. Despite its apparent unreasonableness, such a principle would realistically act in any organization where the mechanism of promotion rewards the best members and where the mechanism at their new level in the hierarchical structure does not depend on the competence they had at the previous level, usually because the tasks of the levels are very different to each other. Here we show, by means of agent based simulations, that if the latter two features actually hold in a given model of an organization with a hierarchical structure, then not only is the Peter principle unavoidable, but also it yields in turn a significant reduction of the global efficiency of the organization. Within a game theory-like approach, we explore different promotion strategies and we find, counterintuitively, that in order to avoid such an effect the best ways for improving the efficiency of a given orga

The bundle map $T^*\hspace{-2pt}\operatorname{U}(n)\longrightarrow\operatorname{U}(n)$ provides a real polarization of the cotangent bundle $T^*\hspace{-2pt}\operatorname{U}(n)$, and yields the geometric quantization $Q_1(T^*\hspace{-2pt}\operatorname{U}(n)) = L^2(\operatorname{U}(n))$. We use the Gelfand-Cetlin systems of Guillemin and Sternberg to show that $T^*\hspace{-2pt}\operatorname{U}(n)$ has a different real polarization with geometric quantization $Q_2(T^*\hspace{-2pt}\operatorname{U}(n))= \bigoplus_αV_α\otimes V_α^*$, where the sum is over all dominant integral weights $α$ of $\operatorname{U}(n)$. The Peter-Weyl theorem, which states that these two quantizations are isomorphic, may therefore be interpreted as an instance of ``invariance of polarization" in geometric quantization.

In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p". The main theorem placed restrictions on the parameters of a primitive but not 2-transitive permutation group of degree three times a prime. The paper was never published, and the results have been superseded by stronger theorems depending on the classification of the finite simple groups, for example a classification of primitive groups of odd degree. However, there are further reasons for being interested in this paper. First, it was written at a time when combinatorial techniques were being introduced into the theory of finite permutation groups, and the paper gives a very good summary and application of these techniques. Second, like its predecessor by Helmut Wielandt on primitive groups of degree 2p, it can be re-interpreted as a combinatorial result concerning association schemes whose common eigenspaces have dimensions of a rather limited form. This result uses neither the primality of p nor the existence of a permutation group related to the combinatorial structure. We extract these results and give details of the related combinatorics.

Remembering the foundational contributions of Peter Freund to supergravity, and especially to the problems of dimensional compactification, reduction is considered with a non-compact space transverse to the lower dimensional theory. The known problem of a continuum of Kaluza-Klein states is avoided here by the occurrence of a mass gap between a single normalizable zero-eigenvalue transverse wavefunction and the edge of the transverse state continuum. This style of reduction does not yield a formally consistent truncation to the lower dimensional theory, so developing the lower-dimensional effective theory requires integrating out the Kaluza-Klein states lying above the mass gap.

This is a survey article about some of the work of Peter Scholze for the Jahresbericht der DMV. No originality is claimed. It is hoped that it can serve as a guideline to an exciting and increasingly large edifice of theory.

We discuss the deformed function algebra of a simply connected reductive Lie group G over the complex numbers using a basis consisting of matrix elements of finite dimensional representations. This leads to a preferred deformation, meaning one where the structure constants of comultiplication are unchanged. The structure constants of multiplication are controlled by quantum 3j symbols. We then discuss connections earlier work on preferred deformations that involved Schur-Weyl duality.

We explicitly bound the Faltings height of a curve over Q polynomially in its Belyi degree. Similar bounds are proven for three other Arakelov invariants: the discriminant, Faltings' delta invariant and the self-intersection of the dualizing sheaf. Our results allow us to explicitly bound Arakelov invariants of modular curves, Hurwitz curves and Fermat curves in terms of their genus. Moreover, as an application, we show that the Couveignes-Edixhoven-Bruin algorithm to compute coefficients of modular forms for congruence subgroups of SL2(Z) runs in polynomial time under the Riemann hypothesis for zeta-functions of number fields. This was known before only for certain congruence subgroups. Finally, we use our results to prove a conjecture of Edixhoven, de Jong and Schepers on the Faltings height of a cover of the projective line with fixed branch locus. Our proof uses Merkl's method for bounding Arakelov-Green's functions to deal with archimedean contributions. In the appendix, Peter Bruin proves an explicit version of Merkl's results.

Book review published as: Aronow, Peter M. and Fredrik Sävje (2020), "The Book of Why: The New Science of Cause and Effect." Journal of the American Statistical Association, 115: 482-485.

A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof based on a key result that every candidate collection, $Ω$, admits an irreducible form. The concept of irreducible collections is one of the key contributions of this paper. We show that the conjecture is true if it holds for a class of irreducible finite collections. Then we show that the conjecture holds for all irreducible finite collections, with non-empty universe.

A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets ($B$), with non-empty universe, admits an abundant element. The best result in the literature states that if $|B|=n$, then there exists $x$ in the universe of $B$ with frequency at least $$\frac{n-1}{\log_2n}.$$ But $(n-1)/(n\log_2n)\rightarrow 0$ as $n\rightarrow \infty$.\\ In this paper, we show that there exists a constant $g>0$ such that for every $B$; there exists $x\in \texttt{U}(B)$ such that $$|B_x|\geq g|B|$$ where $B_x=\{A\in B: x\in A\}$ and $$\texttt{U}(B)=\bigcup_{A\in B}A.$$

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks compatible with positive probability. Up to now, no such graphs were found. We show in this paper that large complete graphs have this property. The question is equivalent to a certain dependent percolation with a power-law behavior: the probability that the origin is blocked at distance n but not closer decreases only polynomially fast and not, as usual, exponentially.

This paper expands upon the work of Peter Olver's paper [Appl. Algebra Engrg. Comm. Comput. 11 (2001), 417-436], wherein Olver uses a moving frames approach to examine the action of a group on a curve within a generalization of jet space known as multispace. Here we seek to further study group actions on the multispace of curves by computing the infinitesimals for a given action. For the most part, we proceed formally, and produce in the multispace a recursion relation that closely mimics the previously known prolongation recursion relations for infinitesimals of a group action on jet space.

This is the first draft of a set of lecture notes developed for one-half of a seminar on two approaches to the notion of "Abelian", namely those of universal algebra, and of category theory. The half pertaining to the universal-algebraic perspective is covered here. All material has been adapted from the following sources: 1. Commutator Theory for Congruence Modular Varieties, by Ralph Freese and Ralph McKenzie. 2. Geometrical Methods in Congruence Modular Algebras, by H. Peter Gumm 3. Congruence Modular Varieties: Commutator Theory and Its Uses, by Ralph McKenzie and John Snow

Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0-1-sequences are random i.i.d. and independent from each other, with probability p of 1's, then if p is sufficiently small they are compatible with positive probability. The question is equivalent to a certain dependent percolation with a power-law behavior: the probability that the origin is blocked at distance n but not closer decreases only polynomially fast and not, as usual, exponentially.

The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence graph exists for any subgroup of a group. We show that the disconnectedness of this graph for codimension one subgroups leads to splittings. We also reprove some results of Peter Kropholler on splittings of groups over malnormal subgroups and variants of them.

As suggested in a Comment by Peters, Phys.\ Rev.\ C {\bf 96}, 029801 (2017), a correction is applied to the $^{13}$C($α$,n)$^{16}$O data of Harissopulos {\it et al.}, Phys.\ Rev.\ C {\bf 72}, 062801(R) (2005). The correction refers to the energy-dependent efficiency of the neutron detector and appears only above the ($α$,n$_1$) threshold of the $^{13}$C($α$,n)$^{16}$O reaction at about $E_α\approx 5$ MeV. The corrected data are lower than the original data by almost a factor of two. The correction method is verified using recent neutron spectroscopy data and data from the reverse $^{16}$O(n,$α$)$^{13}$C reaction.

In this paper we will discuss different coupling methods {suitable for use in} the framework of the recently introduced CutFEM paradigm, cf. Burman, Erik; Claus, Susanne; Hansbo, Peter; Larson, Mats G.; Massing, André . CutFEM: discretizing geometry and partial differential equations. Internat. J. Numer. Methods Engrg. 104 (2015), no. 7, 472-501. In particular we will consider mortaring using Lagrange multipliers on the one hand and Nitsche's method on the other. For simplicity we will first discuss these method in the setting of uncut meshes, and end with some comments on the extension to CutFEM. We will, for comparison, discuss some different types of problems such as high contrast problems and problems with stiff coupling or adhesive contact. We will review some of the existing methods for these problems and propose some alternative methods resulting from crossovers from the Lagrange multiplier framework to Nitsche's method and vice versa.

We prove a classification result for a large class of noncommutative Bernoulli crossed products $(P,φ)^Λ\rtimes Λ$ without almost periodic states. Our results improve the classification results from [1], where only Bernoulli crossed products built with almost periodic states could be treated. We show that the family of factors $(P,φ)^Λ\rtimes Λ$ with $P$ an amenable factor, $φ$ a weakly mixing state (i.e. a state for which the modular automorphism group is weakly mixing) and $Λ$ belonging to a large class of groups, is classified by the group $Λ$ and the action $Λ\curvearrowright (P, φ)^Λ$, up to state preserving conjugation of the action. [1] Stefaan Vaes and Peter Verraedt. Classification of type III Bernoulli crossed products. Adv. Math., 281:296-332, 2015.