scholarly journals Linear time equivalence of Littlewood―Richardson coefficient symmetry maps

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Olga Azenhas ◽  
Alessandro Conflitti ◽  
Ricardo Mamede

International audience Benkart, Sottile, and Stroomer have completely characterized by Knuth and dual Knuth equivalence a bijective proof of the Littlewood―Richardson coefficient conjugation symmetry, i.e. $c_{\mu, \nu}^{\lambda} =c_{\mu^t,\nu^t}^{\lambda ^t}$. Tableau―switching provides an algorithm to produce such a bijective proof. Fulton has shown that the White and the Hanlon―Sundaram maps are versions of that bijection. In this paper one exhibits explicitly the Yamanouchi word produced by that conjugation symmetry map which on its turn leads to a new and very natural version of the same map already considered independently. A consequence of this latter construction is that using notions of Relative Computational Complexity we are allowed to show that this conjugation symmetry map is linear time reducible to the Schützenberger involution and reciprocally. Thus the Benkart―Sottile―Stroomer conjugation symmetry map with the two mentioned versions, the three versions of the commutative symmetry map, and Schützenberger involution, are linear time reducible to each other. This answers a question posed by Pak and Vallejo. Benkart, Sottile, et Stroomer ont complètement caractérisé par équivalence et équivalence duelle à Knuth une preuve bijective de la symétrie de la conjugaison des coefficients de Littlewood―Richardson, i.e. $c_{\mu, \nu}^{\lambda} =c_{\mu^t,\nu^t}^{\lambda ^t}$. Le tableau-switching donne un algorithme par produire une telle preuve bijective. Fulton a montré que les bijections de White et de Hanlon et Sundaram sont des versions de cette bijection. Dans ce papier on exhibe explicitement le mot de Yamanouchi produit par cette bijection de conjugaison lequel à son tour conduit à une nouvelle version très naturelle de la même bijection déjà considérée indépendamment. Une conséquence de cette dernière construction c'est qu'en utilisant des notions de Complexité Computationnelle Relative nous pouvons montrer que cette bijection de symétrie de la conjugaison est linéairement réductible à l'involution de Schützenberger et réciproquement. Ainsi la bijection de symétrie de la conjugaison de Benkart, Sottile et Stroomer avec les deux versions mentionnées, tout comme les trois versions de la bijection de la commutativité, et l'involution de Schützenberger sont linéairement réductibles les unes aux autres. Ça répond à une question posée par Pak et Vallejo.

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.


2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Dieter Rautenbach ◽  
Friedrich Regen

Graph Theory International audience We study graphs G in which the maximum number of vertex-disjoint cycles nu(G) is close to the cyclomatic number mu(G), which is a natural upper bound for nu(G). Our main result is the existence of a finite set P(k) of graphs for all k is an element of N-0 such that every 2-connected graph G with mu(G)-nu(G) = k arises by applying a simple extension rule to a graph in P(k). As an algorithmic consequence we describe algorithms calculating minmu(G)-nu(G), k + 1 in linear time for fixed k.


2009 ◽  
Vol Volume 11, 2009 - Special... ◽  
Author(s):  
Sofia Douda ◽  
Abdelhakim El Imrani ◽  
Mohammed Limouri

International audience The Fractal image compression has the advantage of presenting fast decoding and independent resolution but it suffers of slow encoding phase. In the present study, we propose to reduce the computational complexity by using two domain pools instead of one domain pool and encoding an image in two steps (AP2D approach). AP2D could be applied to classification methods or domain pool reduction methods leading to more reduction in encoding phase. Indeed, experimental results showed that AP2D speed up the encoding time. The time reduction obtained reached a percentage of more than 65% when AP2D was applied to Fisher classification and more than 72% when AP2D was applied to exhaustive search. The image quality was not altered by this approach while the compression ratio was slightly enhanced. La compression fractale d’images permet un décodage rapide et une indépendance de la résolution mais souffre d’une lenteur dans le codage. Le présent travail présente une approche visant à réduire le temps de calcul en utilisant deux dictionnaires et une approximation de l’image en deux étapes (AP2D). L’approche AP2D peut être appliquée aux méthodes de classification ou aux méthodes de réduction du cardinal du dictionnaire et ainsi réduire davantage le temps de codage. Les résultats expérimentaux ont montré que AP2D appliquée à une recherche exhaustive a atteint un gain de temps de plus de 72%. De même AP2D appliquée à la classification de Fisher a permis une réduction de temps de codage de plus de 65%. La qualité de l’image n’a pas été altérée par cette approche et le taux de compression a légèrement augmenté.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Sara Billey ◽  
Alexander Holroyd ◽  
Benjamin Young

International audience We describe a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. The proof extends to a principal specialization of the identity due to Fomin and Stanley. Our bijective tools also allow us to address a problem posed by Fomin and Kirillov from 1997, using work of Wachs, Lenart and Serrano- Stump.


2003 ◽  
Vol DMTCS Proceedings vol. AB,... (Proceedings) ◽  
Author(s):  
Bruno Durand ◽  
Enrico Formenti ◽  
Aristide Grange ◽  
Zsuzsanna Róka

International audience This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Valentin Féray ◽  
Ekaterina A. Vassilieva

International audience We look at the number of permutations $\beta$ of $[N]$ with $m$ cycles such that $(1 2 \ldots N) \beta^{-1}$ is a long cycle. These numbers appear as coefficients of linear monomials in Kerov's and Stanley's character polynomials. D. Zagier, using algebraic methods, found an unexpected connection with Stirling numbers of size $N+1$. We present the first combinatorial proof of his result, introducing a new bijection between partitioned maps and thorn trees. Moreover, we obtain a finer result, which takes the type of the permutations into account. Nous étudions le nombre de permutations $\beta$ de $[N]$ avec $m$ cycles telles que $(1 2 \ldots N) \beta^{-1}$ a un seul cycle. Ces nombres apparaissent en tant que coefficients des monômes linéaires des polynômes de Kerov et de Stanley. À l'aide de méthodes algébriques, D. Zagier a trouvé une connexion inattendue avec les nombres de Stirling de taille $N+1$. Nous présentons ici la première preuve combinatoire de son résultat, en introduisant une nouvelle bijection entre des cartes partitionnées et des arbres épineux. De plus, nous obtenons un résultat plus fin, prenant en compte le type des permutations.


2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Gordana Manić ◽  
Yoshiko Wakabayashi

International audience We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation guarantee known so far for these problems has ratio $3/2 + ɛ$, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver in 1989. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs.


2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Patricia Muldoon ◽  
Margaret A. Readdy

International audience We study enumerative and homological properties of the Rees product of the cubical lattice with the chain. We give several explicit formulas for the Möbius function. The last formula is expressed in terms of the permanent of a matrix and is given by a bijective proof. Nous étudions des propriétés énumératives et homologiques du produit de Rees du treillis cubique avec la chaîne. Nous donnons plusieurs formules explicites de la fonction de Möbius de ce poset. La dernière de ces formules est exprimée en termes du permanent d’une matrice et le résultat est donné par une preuve bijective.


2021 ◽  
Author(s):  
Anneke Haga ◽  
Carsten Lutz ◽  
Leif Sabellek ◽  
Frank Wolter

We introduce and study several notions of approximation for ontology-mediated queries based on the description logics ALC and ALCI. Our approximations are of two kinds: we may (1) replace the ontology with one formulated in a tractable ontology language such as ELI or certain TGDs and (2) replace the database with one from a tractable class such as the class of databases whose treewidth is bounded by a constant. We determine the computational complexity and the relative completeness of the resulting approximations. (Almost) all of them reduce the data complexity from coNP-complete to PTime, in some cases even to fixed-parameter tractable and to linear time. While approximations of kind (1) also reduce the combined complexity, this tends to not be the case for approximations of kind (2). In some cases, the combined complexity even increases.


2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Jérôme Durand-Lose

International audience Cellular automata are mappings over infinite lattices such that each cell is updated according tothe states around it and a unique local function.Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks.We prove that any d-dimensional reversible cellular automaton can be exp ressed as thecomposition of d+1 block permutations.We built a simulation in linear time of reversible cellular automata by reversible block cellular automata (also known as partitioning CA and CA with the Margolus neighborhood) which is valid for both finite and infinite configurations. This proves a 1990 conjecture by Toffoli and Margolus <i>(Physica D 45)</i> improved by Kari in 1996 <i>(Mathematical System Theory 29)</i>.


Sign in / Sign up

Export Citation Format

Share Document