Báo cáo toán học: "A polar area inequality for hyponormal spectra " pptx

Báo cáo toán học: "A Fixed Point Theorem for Nonexpansive Mappings in Locally Convex Spaces" ppt

Báo cáo toán học: "A Fixed Point Theorem for Nonexpansive Mappings in Locally Convex Spaces" ppt

... F, min) is probabilistic strictly convex then its corresponding (X, {p λ }) is strictly convex. Proof. Putting t = 1 in Definition 7 we get A Fixed Point Theorem for Nonexpansive Mappings in Locally ... min) satisfy the following condition: For each fixed t ∈ R, the function F x (t):X → [0, 1] is weakly lower semi- continuous in x ∈ X. (3) A Fixed Point Theorem...

Ngày tải lên: 06/08/2014, 05:20

7 297 1
Báo cáo toán học: "A Gagliardo-Nirenberg Inequality for Lorentz Spaces" pps

Báo cáo toán học: "A Gagliardo-Nirenberg Inequality for Lorentz Spaces" pps

... W ,∞ (R n ). The following result is an extension of the Gagliardo-Nirenberg inequality ([2 - 6]) to Lorentz spaces. Note that the Gagliardo-Nirenberg inequality has applications to partial differential ... of the Gagliardo-Nirenberg inequality to Lorentz spaces. Let Φ : [0, ∞) → [0, ∞) be a non-zero concave function, which is non-decreasing and Φ(0+) = Φ(0) = 0. We put Φ(∞) =...

Ngày tải lên: 06/08/2014, 05:20

7 257 0
Báo cáo toán học: " A Specht Module Analog for the Rook Monoid" pot

Báo cáo toán học: " A Specht Module Analog for the Rook Monoid" pot

... well as an analog of Schur-Weyl duality for R n , and Halverson et al.[1] have found an R n analog of the Murnaghan-Nakayama rule, a combinatorial construction of the irreducible characters of ... In this paper, we analyze the representations of a related algebraic structure called the rook monoid from a combinatorial angle. In particular, we give a combinatorial const...

Ngày tải lên: 07/08/2014, 06:23

10 374 0
Báo cáo toán học: "A Generalisation of Transversals for Latin Squares'''' docx

Báo cáo toán học: "A Generalisation of Transversals for Latin Squares'''' docx

... A Generalisation of Transversals for Latin Squares Ian M. Wanless Christ Church St Aldates Oxford OX1 1DP United Kingdom wanless@maths.ox.ac.uk We define a k-plex to be a partial latin square of ... to be filled. A partial latin square with every cell filled is a latin square. The set of partial latin squares of order n is denoted by PLS(n), and the set of latin squar...

Ngày tải lên: 07/08/2014, 06:23

15 364 0
Báo cáo toán học: "A λ-ring Frobenius Characteristic for G Sn" ppsx

Báo cáo toán học: "A λ-ring Frobenius Characteristic for G Sn" ppsx

... (g 1 1 ,g 2 2) (g 3 3 ,g 4 4) (g 5 5). Throughout this paper, the c conjugacy classes of G will be denoted by C 1 , ,C c .If g 1 , ,g k ∈ G, we define (g 1 i 1 , ,g k i k )tobeaC j -cycle if g k g k−1 ·· g 1 ∈ ... H is a subgroup of a group G, letA↑ G H denote the induced representation of A to G. Ifφ A↑ G H is the character of A↑ G H , then for any τ ∈ G, φ A↑ G...

Ngày tải lên: 07/08/2014, 08:20

33 324 0
Báo cáo toán học: "A Sperner-Type Theorem for Set-Partition Systems" ppsx

Báo cáo toán học: "A Sperner-Type Theorem for Set-Partition Systems" ppsx

... Sperner partition system in P ck k is a uniform partition system. the electronic journal of combinatorics 12 (2005), #N20 4 A Sperner-Type Theorem for Set-Partition Systems Karen Meagher Department ... k-partition system of an n-set for any k and n. 1 Introduction In this paper, we prove a Sperner-type theorem for systems of set partitions and re- lated results. These theorem...

Ngày tải lên: 07/08/2014, 08:22

6 206 0
Báo cáo toán học: "A New Family of Somos-like Recurrences" pptx

Báo cáo toán học: "A New Family of Somos-like Recurrences" pptx

... journal of combinatorics 15 (2008), #R54 5 A New Family of Somos-like Recurrences Paul Heideman University of Wisconsin Madison, WI 53705 ppheideman@wisc.edu Emilie Hogan Department of Mathematics Rutgers, ... has been helpful in producing a combinatorial proof of integrality in some cases, many people pre- fer proofs of Laurentness versus other proofs of integrality. In...

Ngày tải lên: 07/08/2014, 15:23

8 205 0
Báo cáo toán học: "A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture" pdf

Báo cáo toán học: "A graph-theoretic method for choosing a spanning set for a finite-dimensional vector space, with applications to the Grossman-Larson-Wright module and the Jacobian conjecture" pdf

... have full rank. We translate this idea into a graph-theoretic method for finding a spanning set of vectors for a finite- dimensional vector space from among a set of vectors generated combinatorially. This ... vector space, with applications to the Grossman-Larson-Wright mo du le and the Jacobian conjecture Dan Singer Department of Mathematics and S...

Ngày tải lên: 07/08/2014, 21:21

21 300 0
Báo cáo toán học: "A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets" potx

Báo cáo toán học: "A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets" potx

... whether a superlinear lower bound exists for M(n, n). The quantity M(n, n) gives an upper bound for the largest convexly independent subset of P ⊕ P, and it is related to the convex dimension of ... least the diameter of the point set P . The chain C has n + 1 vertices including two endpoints. Now we can the electronic journal of combinatorics 17 (2010),...

Ngày tải lên: 08/08/2014, 11:20

4 339 0
w