scholarly journals Polynomial functions on Young diagrams arising from bipartite graphs

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Maciej Dolęga ◽  
Piotr Sniady
Keyword(s):  
Differential Calculus ◽  
Polynomial Function ◽  
Bipartite Graphs ◽  
Polynomial Functions ◽  
Young Diagrams ◽  
Combinatorial Properties ◽  
International Audience ◽  
Class Of Functions

International audience We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the sense of Kerov and Olshanski) in terms of combinatorial properties of the corresponding bipartite graphs. Our method involves development of a differential calculus of functions on the set of generalized Young diagrams. Nous étudions la classe des fonctions sur l'ensemble des diagrammes de Young (généralisés) qui sont définies comme des nombres d'injections de graphes bipartites. Nous donnons un critère pour savoir si une telle fonction est une fonctions polynomiale sur les diagrammes de Young (au sens de Kerov et Olshanski) utilisant les propriétés combinatoires des graphes bipartites correspondants. Notre méthode repose sur le développement d'un calcul différentiel sur les fonctions sur les diagrammes de Young généralisés.

scholarly journals Fluctuations of central measures on partitions

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Pierre-Loïc Mèliot
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Symmetric Group ◽  
Central Limit ◽  
Symmetric Groups ◽  
Polynomial Functions ◽  
Young Diagrams ◽  
Random Partitions ◽  
Infinite Symmetric Group ◽  
International Audience

International audience We study the fluctuations of models of random partitions $(\mathbb{P}_n,ω )_n ∈\mathbb{N}$ stemming from the representation theory of the infinite symmetric group. Using the theory of polynomial functions on Young diagrams, we establish a central limit theorem for the values of the irreducible characters $χ ^λ$ of the symmetric groups, with $λ$ taken randomly according to the laws $\mathbb{P}_n,ω$ . This implies a central limit theorem for the rows and columns of the random partitions, and these ``geometric'' fluctuations of our models can be recovered by relating central measures on partitions, generalized riffle shuffles, and Brownian motions conditioned to stay in a Weyl chamber. Nous étudions les fluctuations de modèles de partitions aléatoires $(\mathbb{P}_n,ω )_n ∈\mathbb{N}$ issus de la théorie des représentations du groupe symétrique infini. En utilisant la théorie des fonctions polynomiales sur les diagrammes de Young, nous établissons un théorème central limite pour les valeurs des caractères irréductibles $χ ^λ$ des groupes symétriques, avec $λ$ pris aléatoirement suivant les lois $\mathbb{P}_n,ω$ . Ceci implique un théorème central limite pour les lignes et les colonnes des partitions aléatoires, et ces fluctuations ``géométriques'' de nos modèles peuvent être retrouvées en reliant les mesures centrales sur les partitions, les battages généralisés de cartes, et les mouvements browniens conditionnés à rester dans une chambre de Weyl.

Matrix representation of formal polynomials over max-plus algebra

2020 ◽  
pp. 2150216
Author(s):  
Cailu Wang ◽  
Yuegang Tao
Keyword(s):  
Matrix Method ◽  
Polynomial Algorithm ◽  
Polynomial Function ◽  
Matrix Representation ◽  
Sufficient Condition ◽  
Polynomial Functions ◽  
Canonical Forms ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Necessary And Sufficient

This paper proposes the matrix representation of formal polynomials over max-plus algebra and obtains the maximum and minimum canonical forms of a polynomial function by standardizing this representation into a canonical form. A necessary and sufficient condition for two formal polynomials corresponding to the same polynomial function is derived. Such a matrix method is constructive and intuitive, and leads to a polynomial algorithm for factorization of polynomial functions. Some illustrative examples are presented to demonstrate the results.

scholarly journals A note on local polynomial functions on commutative semigroups

1982 ◽  
Vol 33 (1) ◽  
pp. 50-53
Author(s):  
P. A. Grossman
Keyword(s):  
Positive Integer ◽  
Universal Algebra ◽  
Polynomial Function ◽  
Polynomial Functions ◽  
Commutative Semigroups ◽  
Local Polynomial ◽  
A Chain

AbstractGiven a universal algebra A, one can define for each positive integer n the set of functions on A which can be “interpolated” at any n elements of A by a polynomial function on A. These sets form a chain with respect to inclusion. It is known for several varieties that many of these sets coincide for all algebras A in the variety. We show here that, in contrast with these results, the coincident sets in the chain can to a large extent be specified arbitrarily by suitably choosing A from the variety of commutative semigroups.

scholarly journals The Extrapolar SWIFT model (version 1.0): fast stratospheric ozone chemistry for global climate models

2018 ◽  
Vol 11 (2) ◽  
pp. 753-769 ◽  
Author(s):  
Daniel Kreyling ◽  
Ingo Wohltmann ◽  
Ralph Lehmann ◽  
Markus Rex
Keyword(s):  
Polynomial Function ◽  
Stratospheric Ozone ◽  
Ozone Layer ◽  
Rate Of Change ◽  
Polynomial Functions ◽  
Mixing Ratio ◽  
Fourth Degree ◽  
Stratospheric Chemistry ◽  
Wide Range ◽  
Atlas Model

Abstract. The Extrapolar SWIFT model is a fast ozone chemistry scheme for interactive calculation of the extrapolar stratospheric ozone layer in coupled general circulation models (GCMs). In contrast to the widely used prescribed ozone, the SWIFT ozone layer interacts with the model dynamics and can respond to atmospheric variability or climatological trends. The Extrapolar SWIFT model employs a repro-modelling approach, in which algebraic functions are used to approximate the numerical output of a full stratospheric chemistry and transport model (ATLAS). The full model solves a coupled chemical differential equation system with 55 initial and boundary conditions (mixing ratio of various chemical species and atmospheric parameters). Hence the rate of change of ozone over 24 h is a function of 55 variables. Using covariances between these variables, we can find linear combinations in order to reduce the parameter space to the following nine basic variables: latitude, pressure altitude, temperature, overhead ozone column and the mixing ratio of ozone and of the ozone-depleting families (Cly, Bry, NOy and HOy). We will show that these nine variables are sufficient to characterize the rate of change of ozone. An automated procedure fits a polynomial function of fourth degree to the rate of change of ozone obtained from several simulations with the ATLAS model. One polynomial function is determined per month, which yields the rate of change of ozone over 24 h. A key aspect for the robustness of the Extrapolar SWIFT model is to include a wide range of stratospheric variability in the numerical output of the ATLAS model, also covering atmospheric states that will occur in a future climate (e.g. temperature and meridional circulation changes or reduction of stratospheric chlorine loading). For validation purposes, the Extrapolar SWIFT model has been integrated into the ATLAS model, replacing the full stratospheric chemistry scheme. Simulations with SWIFT in ATLAS have proven that the systematic error is small and does not accumulate during the course of a simulation. In the context of a 10-year simulation, the ozone layer simulated by SWIFT shows a stable annual cycle, with inter-annual variations comparable to the ATLAS model. The application of Extrapolar SWIFT requires the evaluation of polynomial functions with 30–100 terms. Computers can currently calculate such polynomial functions at thousands of model grid points in seconds. SWIFT provides the desired numerical efficiency and computes the ozone layer 104 times faster than the chemistry scheme in the ATLAS CTM.

scholarly journals Boolean complexes and boolean numbers

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Bridget Eileen Tenner
Keyword(s):  
Coxeter Group ◽  
Bruhat Order ◽  
Graph Invariant ◽  
Coxeter System ◽  
Combinatorial Properties ◽  
Nous Montrons ◽  
International Audience ◽  
Order Ideals ◽  
Simplicial Poset ◽  
The Ideal

International audience The Bruhat order gives a poset structure to any Coxeter group. The ideal of elements in this poset having boolean principal order ideals forms a simplicial poset. This simplicial poset defines the boolean complex for the group. In a Coxeter system of rank n, we show that the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of these spheres is the boolean number, which can be computed inductively from the unlabeled Coxeter system, thus defining a graph invariant. For certain families of graphs, the boolean numbers have intriguing combinatorial properties. This work involves joint efforts with Claesson, Kitaev, and Ragnarsson. \par L'ordre de Bruhat munit tout groupe de Coxeter d'une structure de poset. L'idéal composé des éléments de ce poset engendrant des idéaux principaux ordonnés booléens, forme un poset simplicial. Ce poset simplicial définit le complexe booléen pour le groupe. Dans un système de Coxeter de rang n, nous montrons que le complexe booléen est homotopiquement équivalent à un bouquet de sphères de dimension (n-1). Le nombre de ces sphères est le nombre booléen, qui peut être calculé inductivement à partir du système de Coxeter non-étiquetté; définissant ainsi un invariant de graphe. Pour certaines familles de graphes, les nombres booléens satisfont des propriétés combinatoires intriguantes. Ce travail est une collaboration entre Claesson, Kitaev, et Ragnarsson.

scholarly journals Disimplicial arcs, transitive vertices, and disimplicial eliminations

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Martiniano Eguia ◽  
Francisco Soulignac
Keyword(s):  
Efficient Algorithm ◽  
Bipartite Graphs ◽  
Space Complexity ◽  
Time And Space ◽  
Graph Classes ◽  
International Audience ◽  
Time And Space Complexity ◽  
Finite Posets

International audience In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A <i>diclique</i> of a digraph is a pair $V$ &rarr; $W$ of sets of vertices such that $v$ &rarr; $w$ is an arc for every $v$ &isin; $V$ and $w$ &isin; $W$. An arc $v$ &rarr; $w$ is <i>disimplicial</i> when it belongs to a unique maximal diclique. We show that the problem of finding the disimplicial arcs is equivalent, in terms of time and space complexity, to that of locating the transitive vertices. As a result, an efficient algorithm to find the bisimplicial edges of bipartite graphs is obtained. Then, we develop simple algorithms to build disimplicial elimination schemes, which can be used to generate bisimplicial elimination schemes for bipartite graphs. Finally, we study two classes related to perfect disimplicial elimination digraphs, namely weakly diclique irreducible digraphs and diclique irreducible digraphs. The former class is associated to finite posets, while the latter corresponds to dedekind complete finite posets.

scholarly journals A categorification of the chromatic symmetric polynomial

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Radmila Sazdanović ◽  
Martha Yip
Keyword(s):  
Symmetric Function ◽  
Symmetric Polynomial ◽  
Chromatic Polynomial ◽  
Khovanov Homology ◽  
Symmetric Polynomials ◽  
Nous Obtenons ◽  
Combinatorial Properties ◽  
International Audience ◽  
Chromatic Symmetric Function ◽  
Frobenius Series

International audience The Stanley chromatic polynomial of a graph $G$ is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology $H$<sub>*</sub>($G$) of graded $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. We also obtain analogues of several familiar properties of the chromatic symmetric polynomials in terms of homology. Le polynôme chromatique symétrique d’un graphe $G$ est une généralisation par une fonction symétrique du polynôme chromatique, et possède des propriétés combinatoires intéressantes. Nous appliquons les techniques de l’homologie de Khovanov pour construire une homologie $H$<sub>*</sub>($G$) de modules gradués $S_n$, dont la série bigraduée de Frobeniusse $Frob_G(q,t)$ réduit au polynôme chromatique symétrique à $q=t=1$. Nous obtenons également des analogies pour plusieurs propriétés connues des polynômes chromatiques en termes d’homologie.

scholarly journals Binary Labelings for Plane Quadrangulations and their Relatives

2011 ◽  
Vol Vol. 12 no. 3 (Graph and Algorithms) ◽  
Author(s):  
Stefan Felsner ◽  
Clemens Huemer ◽  
Sarah Kappes ◽  
David Orden
Keyword(s):  
Bipartite Graphs ◽  
Plane Graphs ◽  
International Audience ◽  
Tree Decompositions

Graphs and Algorithms International audience Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder's one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow to define the regions of a vertex such that counting faces in them yields an algorithm for embedding the quadrangulation, in this case on a 2-book. Furthermore, as Schnyder labelings have been extended to 3-connected plane graphs, we are able to extend our labeling from quadrangulations to a larger class of 2-connected bipartite graphs.

scholarly journals Detection number of bipartite graphs and cubic graphs

2014 ◽  
Vol Vol. 16 no. 3 ◽  
Author(s):  
Frederic Havet ◽  
Nagarajan Paramaguru ◽  
Rathinaswamy Sampathkumar
Keyword(s):  
Positive Integer ◽  
Bipartite Graph ◽  
Connected Graph ◽  
Minimum Degree ◽  
Bipartite Graphs ◽  
Sufficient Condition ◽  
Cubic Graphs ◽  
Cubic Graph ◽  
International Audience ◽  
Np Complete

International audience For a connected graph G of order |V(G)| ≥3 and a k-labelling c : E(G) →{1,2,…,k} of the edges of G, the code of a vertex v of G is the ordered k-tuple (ℓ1,ℓ2,…,ℓk), where ℓi is the number of edges incident with v that are labelled i. The k-labelling c is detectable if every two adjacent vertices of G have distinct codes. The minimum positive integer k for which G has a detectable k-labelling is the detection number det(G) of G. In this paper, we show that it is NP-complete to decide if the detection number of a cubic graph is 2. We also show that the detection number of every bipartite graph of minimum degree at least 3 is at most 2. Finally, we give some sufficient condition for a cubic graph to have detection number 3.

scholarly journals Ore and Erdős type conditions for long cycles in balanced bipartite graphs

2009 ◽  
Vol Vol. 11 no. 2 (Graph and Algorithms) ◽  
Author(s):  
Janusz Adamus ◽  
Lech Adamus
Keyword(s):  
Bipartite Graph ◽  
Bipartite Graphs ◽  
Long Cycle ◽  
International Audience ◽  
Long Cycles

Graphs and Algorithms International audience We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a long cycle C(2n-2k), where 0 <= k < n/2. For k = 0, these are the classical hamiltonicity criteria of Moon and Moser. The main two results of the paper assert that our conjectures hold for k = 1 as well.

Sign in / Sign up

Export Citation Format

Share Document