Ce mémoire vise à faire une synthèse sur la Schur positivité des différences de fonctions de Schur gauches. On cherche à voir la représentation de cet ensemble de fonctions à l'aide de la Schur positivité. Pour ce faire, on introduit premièrement les notions de base nécessaires à sa compréhension tel que les permutations, les partages, les diagrammes, les tableaux et les ensembles partiellement ordonnés. Ensuite une discussion sur l'algèbre graduée des fonctions symétriques s'impose puisque les fonctions de Schur forment une base des fonctions symétriques. On présente dans un deuxième temps certaines bases des fonctions symétriques. En fait, on voit la base des fonctions homogènes, la base des fonctions élémentaires et la base des fonctions monomiales. On voit par ailleurs la m-positivité qui est un autre ordre partiel semblable à la Schur positivité. En ce qui a trait aux fonctions de Schur gauches, on tente plus particulièrement de comprendre les égalités qui surviennent entre certaines fonctions de Schur gauches. On tente aussi de faire le point (en partie) sur les inégalités des coefficients de Littlewood-Richardson qui apparaissent lors d'un produit de fonctions de Schur ou lorsqu'on écrit les fonctions de Schur gauches en termes de fonctions de Schur. De plus, on veut trouver les seuls diagrammes gauches nécessaires à la représentation des ensembles partiellement ordonnés des fonctions de Schur gauches. Enfin, on vise à présenter certains ensembles partiellement ordonnés par la Schur positivité des fonctions de Schur gauches, de même qu'être en mesure de montrer l'existence d'un maximum d'arêtes liant les différents niveaux de la représentation de l'ensemble partiellement ordonné par la Schur positivité des fonctions de Schur gauches.

Univ., Diss., 2001--Liverpool

Thesis (Ph.D)--Washington State University, August 2006. / Includes bibliographical references (p. 91-93).

Accelerating the convergence rate of Krylov subspace methods with parallelizable preconditioners is essential for obtaining effective iterative solvers for very large linear systems of equations. Substructuring provides a framework for constructing robust and parallel preconditioners for linear systems arising from the discretization of boundary value problems. Although collocation is a very general and effective discretization technique for many PDE problems, there has been relatively little work on preconditioners for collocation problems. This thesis proposes two preconditioning methods for solving linear systems of equations arising from Hermite bicubic collocation discretization of elliptic partial differential equations on square domains with mixed boundary conditions. The first method, called <i>edge preconditioning</i>, is based on a decomposition of the domain in parallel strips, and the second, called <i>edge-vertex preconditioning</i>, is based on a two-dimensional decomposition. The preconditioners are derived in terms of two special rectangular grids -- a coarse grid with diameter <i>H</i> and a hybrid coarse/fine grid -- which together with the fine grid of diameter <i>h</i> provide the framework for approximating the interface problem induced by substructuring. We show that the proposed methods are effective for nonsymmetric indefinite problems, both from the point of view of the cost per iteration and of the number of iterations. For an appropriate choice of <i>H</i>, the edge preconditioner requires <i>O(N)</i> arithmetic operations per iteration, while the edge-vertex preconditioner requires <i>O(N^4/3)</i> operations, where <i>N</i> is the number of unknowns. For the edge-vertex preconditioner, the number of iterations is almost constant when <i>h</i> and <i>H</i> decrease such that <i>H/h</i> is held constant and it increases very slowly with <i>H</i> when <i>h</i> is held constant. For both the edge- and edge-vertex preconditioners the number of iterations depends only weakly on <i>h</i> when <i>H</i> is constant. The edge-vertex preconditioner outperforms the edge-preconditioner for small enough <i>H</i>. Numerical experiments illustrate the parallel efficiency of the preconditioners which is similar or even better than that provided by the well-known PETSc parallel software library for scientific computing. / Ph. D.

Le thème central de cette thèse porte sur des partitions en n parties de l'intervalle entier [1, N] = {1,2,...,N} excluant la présence, dans chaque partie, de solution de l'équation x + y = z dans le cas classique, ou seulement de telles solutions avec x ≠ y dans le cas faible. Pour n donné, le plus grand N admissible dans le cas classique se note S(n) et s'appelle le n-ème nombre de Schur ; dans le cas faible, il se note WS(n) et s'appelle le n-ème nombre de Schur faible. Bien qu'introduits il y a plusieurs décénnies déjà, et même il y a un siècle dans le cas classique, on ne sait encore que très peu de choses au sujet de ces nombres. En particulier, S(n) et WS(n) ne sont exactement connus que pour n ≤ 4. Cette thèse est composée de deux chapitres : le premier revisite des encadrements connus sur les nombres de Schur classiques et faibles, et le second est consacré à la construction de nouveaux minorants des nombres de Schur faibles WS(n) pour n = 7, 8 et 9. Nous introduisons, dans le premier chapitre, les ensembles t-libres de sommes, t ∊ ℕ, dont l'utilisation permet de généraliser et d'unifier diverses démonstrations de majorants des S(n) et WS(n). Nous obtenons également une relation entre WS(n + 1) et WS(n). Dans le second chapitre, nous initions l'étude de certaines partitions hautement structurées présentant un potentiel intéressant pour le problème de minorer les nombres WS(n). Effectivement, avec des algorithmes de recherche ne portant que sur ces partitions, nous retrouvons les meilleurs minorants connus sur WS(n) pour 1 ≤ n ≤ 6, et nous améliorons significativement ceux pour 7 ≤ n ≤ 9. / The main theme of this thesis is about partitions in n parts of the integer interval [1, N] = {1,2,...N} excluding the presence, in each part, of solutions of the equation x + y = z in the classical case, or only of such solution with x ≠ y in the weak case. For given n, the largest admissible N in the classical case, it is denoted S(n) and called the n-th Schur number ; in the weak case, it is denoted WS(n) and called the n-th weak Schur number. Even though these numbers were already introduced several decades ago, and even a century ago in the classical case, almost nothing is known about them. In particular, S(n) and WS(n) are exactly known for n ≤ 4. This thesis comprises two chapters :the first one revisits known lower and upper bounds on the classical weak Schur numbers, and the second one is dedicated to the construction of the new lower bounds on the weak Schur numbers WS(n) for n = 7,8 and 9. In the first chapter, we introduce the t-sumfree sets, t ∊ ℕ, which allow us to generalize and unify various proofs concerning upper bounds on S(n) and WS(n). We also obtain a new relationship between WS(n + 1) and WS(n).In the second chapter, we initiate the study of certain highly structured partitions which present an interesting potential for the problem of bounding the numbers WS(n) from below. Indeed, with search algorithms considering only partitions, we rediscover the best known lower bounds on WS(n) for 1 ≤ n ≤ 6, and we significatively improve those for 7 ≤ n ≤ 9.

In this paper I investigate properties of square complex matrices of the form Ak, where A is also a complex matrix, and k is a nonnegative integer. I look at several ways of representing Ak. In particular, I present an identity expressing the kth power of the Schur form T of A in terms of the elements of T, which can be used together with the Schur decomposition to provide an expression of Ak. I also explain bounds on the norm of Ak, including some based on the element-based expression of Tk. Finally, I provide a detailed exposition of the most current form of the Kreiss Matrix Theorem.

The theme of this thesis is combinatorics, complex analysis and algebraic geometry. The thesis consists of six articles divided into four parts. Part A: Spectral properties of the Schrödinger equation This part consists of Papers I-II, where we study a univariate Schrödinger equation with a complex polynomial potential. We prove that the set of polynomial potentials that admit solutions to the Schrödingerequation is connected, under certain boundary conditions. We also study a similar result for even polynomial potentials, where a similar result is obtained. Part B: Graph monomials and sums of squares In this part, consisting of Paper III, we study natural bases for the space of homogeneous, symmetric and translation-invariant polynomials in terms of multigraphs. We find all multigraphs with at most six edges that give rise to non-negative polynomials, and which of these that can be expressed as a sum of squares. Such polynomials appear naturally in connection to expressing certain non-negative polynomials as sums of squares. Part C: Eigenvalue asymptotics of banded Toeplitz matrices This part consists of Papers IV-V. We give a new and generalized proof of a theorem by P. Schmidt and F. Spitzer concerning asymptotics of eigenvalues of Toeplitz matrices. We also generalize the notion of eigenvalues to rectangular matrices, and partially prove the a multivariate analogue of the above. Part D: Stretched Schur polynomials This part consists of Paper VI, where we give a combinatorial proof that certain sequences of skew Schur polynomials satisfy linear recurrences with polynomial coefficients. / <p>At the time of doctoral defence the following papers were unpublished and had a status as follows: Paper 5: Manuscript; Paper 6: Manuscript</p>

Made available in DSpace on 2016-06-02T20:28:28Z (GMT). No. of bitstreams: 1 5368.pdf: 682883 bytes, checksum: 5c5cfc6294b1e5bb055b5a66c6f09101 (MD5) Previous issue date: 2013-06-27 / Financiadora de Estudos e Projetos / A classical theorem of differential geometry of curves in Euclidean space is the Schur's Theorem, that was proof by A. Schur in 1921, when both curvatures agree pointwise [3]. The proof in the general case was proved in 1925 by E. Schmidt in [4]. The first objective in this dissertation is to present Lorentzian version of Schur's Theorem in the Minkowski plane. Then we will show some applications due to R. López [1]. In the Minkowski space we will see that the Schur's Theorem is false. The second objective is show a characterization of slant helices in the Minkowski space obtained by A. T. Ali and R. López in [2], which extends naturally a characterization of slant helices in Euclidean space obtained in 2004 by S. Izumiya And N. Takeuchi [6]. We conclude with an application that characterization of slant helices [2]. / Um resultado clássico da geometria diferencial de curvas no espaço euclidiano é o Teorema de Schur, que primeiro foi provado em 1921 por A. Schur em [3] no caso em que as curvaturas das curvas coincidem pontualmente. O caso geral do teorema foi provado em 1925 por E. Schmidt em [4]. O primeiro objetivo desta dissertação é apresentar uma versão do Teorema de Shur para o plano de Minkowski. Em seguida, mostraremos algumas aplicações desse resultado feitas por R. López em [1]. No caso do espaço de Minkowski veremos que o Teorema de Schur é falso. O segundo objetivo é mostrar uma caracterização das hélices inclinadas no espaço de Minkowski obtidas por A. T. Ali e R. López em [2], a qual estende de forma natural a caracterização de hélices inclinadas no espaço euclidiano obtida em 2004 por S. Izumiya e N. Takeuchi [6]. Concluímos esta dissertação provando uma caracterização de hélices inclinadas obtida em [2].

P-version finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary results for 1D case, condition number estimates and some inequalities for 2D reference element. Part II is devoted to the derivation of the Schur complement preconditioner and conditionality number estimates for the p-version finite element matrixes. Also DD preconditioning is considered.

Representation theory is the study of abstract algebraic structures by representing their elements as linear transformations or matrices. It provides a bridge between the abstract symbolic mathematics and its explicit applications in nearly every branch of mathematics. Combinatorial representation theory aims to use combinatorial objects to model representations, thus answering questions in this field combinatorially. Combinatorial objects are used to help describe, count and generate representations. This has led to a rich symbiotic relationship where combinatorics has helped answer algebraic questions and algebraic techniques have helped answer combinatorial questions. In this thesis we discuss the representation theory of the symmetric group and the general linear group. The theory of these two families of groups is often considered the corner stone of combinatorial representation theory. Results and techniques arising from the study of these groups have been successfully generalized to a very wide class of groups. An overview of some of the generalizations can be found in [BR99]. There are also many avenues for further generalizations which are currently being explored. The constructions of the Specht and Schur modules that we discuss here use the concept of Young tableaux. Young tableaux are combinatorial objects that were introduced by the Reverend Alfred Young, a mathematician at Cambridge University, in 1901. In 1903, Georg Frobenius applied them to the study of the symmetric group. Since then, they have been found to play an important role in the study of symmetric functions, representation theory of the symmetric and complex general linear groups and Schubert calculus of Grassmannians. Applications of Young tableaux to other branches of mathematics are still being discovered. When drawing and labelling Young tableaux there are a few conflicting conventions in the literature, throughout this thesis we shall be following the English notation. In chapter 1 we shall make a few definitions and state some results which will be used in this thesis. In chapter 2 we discuss the representations of the symmetric group. In this chapter we define the Specht modules and prove that they describe all the irreducible representations of Sn. We conclude with a discussion about the ring of Sn representations which is used to prove some identities of Specht modules. In chapter 3 we discuss the representations of the general linear group. In this chapter we define the Schur modules and prove that they describe all the irreducible rational representations of GLmC. We also show that the set of tableaux forms an indexing set for a basis of the Schur modules. In chapter 4 we describe a relation between the Specht and Schur modules. This is a corollary to the more general Schur-Weyl duality, an overview of which can be found in [BR99]. The appendix contains the code and screen-shots of two computer programs that were written as part of this thesis. The programs have been written in C++ and the data structures have been implemented using the Standard Template Library. The first program gives us information about the representations of Sn for a given n. For a user defined n it will list all the Specht modules corresponding to that n, their dimensions and the standard tableaux corresponding to their basis elements. The second program gives information about a certain representation of GLmC. For a user defined m and λ it gives the dimension and the semistandard tableaux corresponding to the basis elements of the Schur module Eλ .