首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
The Marcus–Lushnikov process is a finite stochastic particle system in which each particle is entirely characterized by its mass. Each pair of particles with masses xx and yy merges into a single particle at a given rate K(x,y)K(x,y). We consider a strongly gelling   kernel behaving as K(x,y)=xαy+xyαK(x,y)=xαy+xyα for some α∈(0,1]α(0,1]. In such a case, it is well-known that gelation occurs, that is, giant particles emerge. Then two possible models for hydrodynamic limits of the Marcus–Lushnikov process arise: the Smoluchowski equation, in which the giant particles are inert, and the Flory equation, in which the giant particles interact with finite ones.  相似文献   

2.
用矩阵的初等变换解矩阵方程Am×nXn×s=Bm×s   总被引:1,自引:1,他引:0  
刘敬 《工科数学》1998,14(4):176-178
本文通过对一般的矩阵方程Am×nXn×s=Bm×s?B5木卣驛和B作初等行变换及初等列变换,给出了一般矩阵方程的求解方法。  相似文献   

3.
Saint Venant's theorem constitutes a classical characterization of smooth matrix fields as linearized strain tensor fields. This theorem has been extended to matrix fields with components in L2 by the second author and P. Ciarlet, Jr. in 2005. One objective of this Note is to further extend this characterization to matrix fields whose components are only in H?1. Another objective is to demonstrate that Saint Venant's theorem is in fact nothing but the matrix analog of Poincaré's lemma. To cite this article: C. Amrouche et al., C. R. Acad. Sci. Paris, Ser. I 342 (2006).  相似文献   

4.
The N-heap Wythoffs game is a two-player impartial game with N piles of tokens of sizes Players take turns removing any number of tokens from a single pile, or removing (a1,..., aN) from all piles - ai tokens from the i-th pile, providing that where is the nim addition. The first player that cannot make a move loses. Denote all the P-positions (i.e., losing positions) by Two conjectures were proposed on the game by Fraenkel [7]. When are fixed, i) there exists an integer N1 such that when . ii) there exist integers N2 and _2 such that when , the golden section.In this paper, we provide a sufficient condition for the conjectures to hold, and subsequently prove them for the three-heap Wythoffs game with the first piles having up to 10 tokens.AMS Subject Classification: 91A46, 68R05.  相似文献   

5.
We give a new approach to the construction of derived equivalences between blocks of finite groups, based on perverse equivalences, in the setting of Broué?s abelian defect group conjecture. We provide in particular local and global perversity data describing the principal blocks and the derived equivalences for a number of finite simple groups with Sylow subgroups elementary abelian of order 9. We also examine extensions to automorphism groups in a general setting.  相似文献   

6.
Global brands emerging from the world of sports are becoming commonplace, and firms invest in the realm of sports, usually through sponsorship initiatives, to get a link with these global brands. Over and above just a mere business link, what if a company makes a personal commitment to get into the core of a renowned, celebrated sports team? This article provides managers with a procedure to analyze, in a weekly basis, how valuable this type of decision is. A conceptual model shows that the personal involvement of a firm’s figurehead in a first-class sports club can impact positively on firm value if the person is doing well in the task s/he is entrusted with by the club. The empirical application to the soccer club Real Madrid, over 1,409 days and 215 matches, finds that the club’s performance on the field has a significant impact on the economic returns of its president’s company, with asymmetrical effects on firm value in a “loss aversion” pattern, that is, lost matches have a greater effect on firm value than games won.  相似文献   

7.
Recently, Boutonnet, Chifan, and Ioana proved that McDuff’s examples of continuum many pairwise non-isomorphic separable II1 factors are in fact pairwise non-elementarily equivalent. Their proof proceeded by showing that any ultrapowers of any two distinct McDuff examples are not isomorphic. In a paper by the first two authors of this paper, Ehrenfeucht–Fra¨?sse games were used to find an upper bound on the quantifier complexity of sentences distinguishing the McDuff examples, leaving it as an open question to find concrete sentences distinguishing the McDuff factors. In this paper, we answer this question by providing such concrete sentences.  相似文献   

8.
The aim of the paper is to obtain some theoretical and numerical properties of Saaty’s and Koczkodaj’s inconsistencies of pairwise comparison matrices (PRM). In the case of 3 ×  3 PRM, a differentiable one-to-one correspondence is given between Saaty’s inconsistency ratio and Koczkodaj’s inconsistency index based on the elements of PRM. In order to make a comparison of Saaty’s and Koczkodaj’s inconsistencies for 4  ×  4 pairwise comparison matrices, the average value of the maximal eigenvalues of randomly generated n ×  n PRM is formulated, the elements a ij (i < j) of which were randomly chosen from the ratio scale
with equal probability 1/(2M − 1) and a ji is defined as 1/a ij . By statistical analysis, the empirical distributions of the maximal eigenvalues of the PRM depending on the dimension number are obtained. As the dimension number increases, the shape of distributions gets similar to that of the normal ones. Finally, the inconsistency of asymmetry is dealt with, showing a different type of inconsistency.  相似文献   

9.
10.
Two natural extensions of Jensen’s functional equation on the real line are the equations f(xy) + f(xy −1) =  2f(x) and f(xy) + f(y −1 x) =  2f(x), where f is a map from a multiplicative group G into an abelian additive group H. In a series of papers (see Ng in Aequationes Math 39:85–99, 1990; Ng in Aequationes Math 58:311–320, 1999; Ng in Aequationes Math 62:143–159, 2001), Ng solved these functional equations for the case where G is a free group and the linear group GLn(R), R=\mathbbZ,\mathbbR{{GL_n(R), R=\mathbb{Z},\mathbb{R}}} , is a quadratically closed field or a finite field. He also mentioned, without a detailed proof, in the above papers and in (see Ng in Aequationes Math 70:131–153, 2005) that when G is the symmetric group S n , the group of all solutions of these functional equations coincides with the group of all homomorphisms from (S n , ·) to (H, + ). The aim of this paper is to give an elementary and direct proof of this fact.  相似文献   

11.
In this paper, I present and analyse Dedekind’s and Weber’s editorial work which led to the edition of Riemann’s Gesammelte Werke in 1876. With several examples, I suggest that this editorial work is to be understood as a mathematical activity in and of itself and provide evidence for it.  相似文献   

12.
13.
Quillen’s algebraic K-theory is reconstructed via Voevodsky’s algebraic cobordism. More precisely, for a ground field k the algebraic cobordism P1-spectrum MGL of Voevodsky is considered as a commutative P1-ring spectrum. Setting we regard the bigraded theory MGL p,q as just a graded theory. There is a unique ring morphism which sends the class [X]MGL of a smooth projective k-variety X to the Euler characteristic of the structure sheaf . Our main result states that there is a canonical grade preserving isomorphism of ring cohomology theories
on the category in the sense of [6], where K*(X on Z) is Thomason–Trobaugh K-theory and K * is Quillen’s K-theory. In particular, the left hand side is a ring cohomology theory. Moreover both theories are oriented in the sense of [6] and ϕ respects the orientations. The result is an algebraic version of a theorem due to Conner and Floyd. That theorem reconstructs complex K-theory via complex cobordism [1].  相似文献   

14.
We define a family of differential operators indexed with fixed point free partitions. When these differential operators act on normalized power sum symmetric functions q(x), the coefficients in the decomposition of this action in the basis q(x) are precisely those of the decomposition of products of corresponding conjugacy classes of the symmetric group Sn. The existence of such operators provides a rigorous definition of Katriels elementary operator representation of conjugacy classes and allows to prove the conjectures he made on their properties.Work partially supported by a grant from the Natural Sciences and Engineering Research Council of Canada.Work partially supported by ECs Research Training Network Algebraic Combinatorics in Europe (grant HPRN-CT-2001-00272).  相似文献   

15.
In this paper, we study Rényi's problem and other related problems about the additive functions in short intervals. As corollaries, we improve Ivic's results.  相似文献   

16.
We show that if Ω?RN,N?2, is a bounded Lipschitz domain and n)?L1(RN) is a sequence of nonnegative radial functions weakly converging to δ0 then there exist C>0 and n0?1 such that
Ωf??Ωfp?CΩΩ|f(x)?f(y)|p|x?y|pρn(|x?y|)dxdy?f∈Lp(Ω)?n?n0.
The above estimate was suggested by some recent work of Bourgain, Brezis and Mironescu (in: Optimal Control and Partial Differential Equations, IOS Press, 2001, pp. 439–455). As n→∞ in (1) we recover Poincaré's inequality. We also extend a compactness result of Bourgain, Brezis and Mironescu. To cite this article: A.C. Ponce, C. R. Acad. Sci. Paris, Ser. I 337 (2003).  相似文献   

17.
In this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix norm with its spectral radius or sign-complex spectral radius for diagonalizable matrices; 1-norm and ∞-norm for non-diagonalizable matrices. We also give the applications to the pole placement problem and the singular system.  相似文献   

18.
Banaschewski’s theorem concerns subdirect product decompositions of lattice ordered groups. In the present paper we deal with the analogous investigation for the case of generalized MV -algebras (GMV -algebras, in short); we apply this notion in the sense studied by Galatos and Tsinakis.  相似文献   

19.
We provide a combinatorial interpretation of Lah numbers by means of planar networks. Henceforth, as a consequence of Lindström's lemma, we conclude that the related Lah matrix possesses a remarkable property of total non-negativity.  相似文献   

20.
We show that the maximum degree of a graph GG is equal to the minimum number of ocm sets covering  GG, where an ocm set is the vertex-disjoint union of elementary odd cycles and one matching, and a collection of ocm sets covers   GG if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号