218 resultados para COMBINATORICS


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Reiner, Shaw and van Willigenburg showed that if two skew Schur functions sA and sB are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that sA and sB have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true. In fact, we work in terms of inequalities, showing that if the F-support of sA contains that of sB, then the row overlap partitions of A are dominated by those of B, and again conjecture that the converse also holds. Our evidence in favor of these conjectures includes their consistency with a complete determination of all F-support containment relations for F-multiplicity-free skew Schur functions. We conclude with a consideration of how some other quasisymmetric bases fit into our framework.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Los materiales de banda intermedia han atraido la atención de la comunidad científica en el campo de la energía solar fotovoltaica en los últimos años. Sin embargo, con el objetivo de entender los fundamentos de las células solares de banda intermedia, se debe llevar a cabo un estudio profundo de la características de los materiales. Esto se puede hacer mediante un modelo teórico usando Primeros Principios. A partir de este enfoque se pueden obtener resultados tales como la estructura electrónica y propiedades ópticas, entre otras, de los semiconductores fuertemente dopados y sus precursores. Con el fin de desentrañar las estructuras de estos sistemas electrónicos, esta tesis presenta un estudio termodinámico y optoelectrónico de varios materiales fotovoltaicos. Específicamente se caracterizaron los materiales avanzados de banda intermedia y sus precursores. El estudio se hizo en términos de caracterización teórica de la estructura electrónica, la energética del sistema, entre otros. Además la estabilidad se obtuvo usando configuraciones adaptadas a la simetría del sistema y basado en la combinatoria. Las configuraciones de los sitios ocupados por defectos permiten obtener información sobre un espacio de configuraciones donde las posiciones de los dopantes sustituidos se basan en la simetría del sólido cristalino. El resultado puede ser tratado usando elementos de termodinámica estadística y da información de la estabilidad de todo el espacio simétrico. Además se estudiaron otras características importantes de los semiconductores de base. En concreto, el análisis de las interacciones de van der Waals fueron incluidas en el semiconductor en capas SnS2, y el grado de inversión en el caso de las espinelas [M]In2S4. En este trabajo además realizamos una descripción teórica exhaustiva del sistema CdTe:Bi. Este material de banda-intermedia muestra características que son distintas a las de los otros materiales estudiados. También se analizó el Zn como agente modulador de la posición de las sub-bandas prohibidas en el material de banda-intermedia CuGaS2:Ti. Analizándose además la viabilidad termodinámica de la formación de este compuesto. Finalmente, también se describió el GaN:Cr como material de banda intermedia, en la estructura zinc-blenda y en wurtztite, usando configuraciones de sitios ocupados de acuerdo a la simetría del sistema cristalino del semiconductor de base. Todos los resultados, siempre que fue posible, fueron comparados con los resultados experimentales. ABSTRACT The intermediate-band materials have attracted the attention of the scientific community in the field of the photovoltaics in recent years. Nevertheless, in order to understand the intermediate-band solar cell fundamentals, a profound study of the characteristics of the materials is required. This can be done using theoretical modelling from first-principles. The electronic structure and optical properties of heavily doped semiconductors and their precursor semiconductors are, among others, results that can be obtained from this approach. In order to unravel the structures of these crystalline systems, this thesis presents a thermodynamic and optoelectronic study of several photovoltaic materials. Specifically advanced intermediate-band materials and their precursor semiconductors were characterized. The study was made in terms of theoretical characterization of the electronic structure, energetics among others. The stability was obtained using site-occupancy-disorder configurations adapted to the symmetry of the system and based on combinatorics. The site-occupancy-disorder method allows the formation of a configurational space of substitutional dopant positions based on the symmetry of the crystalline solid. The result, that can be treated using statistical thermodynamics, gives information of the stability of the whole space of symmetry of the crystalline lattice. Furthermore, certain other important characteristics of host semiconductors were studied. Specifically, the van der Waal interactions were included in the SnS2 layered semiconductor, and the inversion degree in cases of [M]In2S4 spinels. In this work we also carried out an exhaustive theoretical description of the CdTe:Bi system. This intermediate-band material shows characteristics that are distinct from those of the other studied intermediate-band materials. In addition, Zn was analysed as a modulator of the positions of the sub-band gaps in the CuGaS2:Ti intermediate-band material. The thermodynamic feasibility of the formation of this compound was also carried out. Finally GaN:Cr intermediate-band material was also described both in the zinc-blende and the wurtztite type structures, using the symmetry-adapted-space of configurations. All results, whenever possible, were compared with experimental results.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We show the existence of sets with n points (n ? 4) for which every convex decomposition contains more than (35/32)n?(3/2) polygons,which refutes the conjecture that for every set of n points there is a convex decomposition with at most n+C polygons. For sets having exactly three extreme pointswe show that more than n+sqr(2(n ? 3))?4 polygons may be necessary to form a convex decomposition.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This article studies generated scales having exactly three different step sizes within the language of algebraic combinatorics on words. These scales and their corresponding step-patterns are called non well formed. We prove that they can be naturally inserted in the Christoffel tree of well-formed words. Our primary focus in this study is on the left- and right-Lyndon factorization of these words. We will characterize the non-well-formed words for which both factorizations coincide. We say that these words satisfy the LR property and show that the LR property is satisfied exactly for half of the non-well-formed words. These are symmetrically distributed in the extended Christoffel tree. Moreover, we find a surprising connection between the LR property and the Christoffel duality. Finally, we prove that there are infinitely many Christoffel–Lyndon words among the set of non-well-formed words and thus there are infinitely many generated scales having as step-pattern a Christoffel–Lyndon word.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2016-06

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this note we first introduce balanced critical sets and near balanced critical sets in Latin squares. Then we prove that there exist balanced critical sets in the back circulant Latin squares of order 3n for n even. Using this result we decompose the back circulant Latin squares of order 3n, n even, into three isotopic and disjoint balanced critical sets each of size 3n. We also find near balanced critical sets in the back circulant Latin squares of order 3n for n odd. Finally, we examine representatives of each main class of Latin squares of order up to six in order to determine which main classes contain balanced or near balanced critical sets.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador: