Literatura científica selecionada sobre o tema "Algorithmic and combinatorics of monoids"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algorithmic and combinatorics of monoids".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Algorithmic and combinatorics of monoids"
Cain, Alan J., António Malheiro e Fábio M. Silva. "Combinatorics of patience sorting monoids". Discrete Mathematics 342, n.º 9 (setembro de 2019): 2590–611. http://dx.doi.org/10.1016/j.disc.2019.05.022.
Texto completo da fonteAbbes, S., S. Gouëzel, V. Jugé e J. Mairesse. "Asymptotic combinatorics of Artin–Tits monoids and of some other monoids". Journal of Algebra 525 (maio de 2019): 497–561. http://dx.doi.org/10.1016/j.jalgebra.2019.01.019.
Texto completo da fonteDIEKERT, VOLKER, NICOLE ONDRUSCH e MARKUS LOHREY. "ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS". International Journal of Algebra and Computation 18, n.º 01 (fevereiro de 2008): 181–208. http://dx.doi.org/10.1142/s0218196708004366.
Texto completo da fonteHurwitz, Carol M. "On the homotopy theory of monoids". Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 47, n.º 2 (outubro de 1989): 171–85. http://dx.doi.org/10.1017/s1446788700031621.
Texto completo da fonteBLANCHET-SADRI, F. "ALGORITHMIC COMBINATORICS ON PARTIAL WORDS". International Journal of Foundations of Computer Science 23, n.º 06 (setembro de 2012): 1189–206. http://dx.doi.org/10.1142/s0129054112400473.
Texto completo da fonteRENNER, LEX E. "DISTRIBUTION OF PRODUCTS IN FINITE MONOIDS I: COMBINATORICS". International Journal of Algebra and Computation 09, n.º 06 (dezembro de 1999): 693–708. http://dx.doi.org/10.1142/s0218196799000394.
Texto completo da fonteOkniński, Jan, e Magdalena Wiertel. "Combinatorics and structure of Hecke–Kiselman algebras". Communications in Contemporary Mathematics 22, n.º 07 (15 de junho de 2020): 2050022. http://dx.doi.org/10.1142/s0219199720500224.
Texto completo da fonteROSALES, J. C., P. A. GARCÍA-SÁNCHEZ e J. I. GARCÍA-GARCÍA. "PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS". International Journal of Algebra and Computation 12, n.º 05 (outubro de 2002): 659–70. http://dx.doi.org/10.1142/s021819670200105x.
Texto completo da fonteGarg, Vijay K. "Algorithmic combinatorics based on slicing posets". Theoretical Computer Science 359, n.º 1-3 (agosto de 2006): 200–213. http://dx.doi.org/10.1016/j.tcs.2006.03.005.
Texto completo da fontePolo, Harold. "Approximating length-based invariants in atomic Puiseux monoids". Algebra and Discrete Mathematics 33, n.º 1 (2022): 128–39. http://dx.doi.org/10.12958/adm1760.
Texto completo da fonteTeses / dissertações sobre o assunto "Algorithmic and combinatorics of monoids"
Charles, Balthazar. "Combinatorics and computations : Cartan matrices of monoids & minimal elements of Shi arrangements". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG063.
Texto completo da fonteThis thesis presents an investigation into two distinct combinatorial subjects: the effective computation of Cartan matrices in monoid representation theory and the exploration of properties of minimal elements in Shi arrangements of Coxeter groups. Although disparate, both of these research focuses share a commonality in the utilization of combinatorial methods and computer exploration either as an end in itself for the former or as a help to research for the latter. In the first part of the dissertation, we develop methods for the effective computation of character tables and Cartan matrices in monoid representation theory. To this end, we present an algorithm based on our results for the efficient computations of fixed points under a conjugacy-like action, with the goal to implement Thiéry's formula for the Cartan matrix from [Thiéry '12]. After a largely self-contained introduction to the necessary background, we present our results for fixed-point counting, as well as a new formula for the character table of finite monoids. We evaluate the performance of the resulting algorithms in terms of execution time and memory usage and find that they are more efficient than algorithms not specialized for monoids by orders of magnitude. We hope that the resulting (public) implementation will contribute to the monoid representation community by allowing previously impractical computations. The second part of the thesis focuses on the properties of minimal elements in Shi arrangements. The Shi arrangements were introduced in [Shi '87] and are the object of Conjecture 2 from [Dyer, Hohlweg '14]. Originally motivated by this conjecture, we present two results. Firstly, a direct proof in the case of rank 3 groups. Secondly, in the special case of Weyl groups, we give a description of the minimal elements of the Shi regions by extending a bijection from [Athanasiadis, Linusson '99] and [Armstrong, Reiner, Rhoades '15] between parking functions and Shi regions. This allows for the effective computation of the minimal elements. From the properties of this computation, we provide a type-free proof of the conjecture in Weyl groups as an application. These results reveal an intriguing interplay between the non-nesting and non-crossing worlds in the case of classical Weyl groups
Gay, Joël. "Representation of Monoids and Lattice Structures in the Combinatorics of Weyl Groups". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS209/document.
Texto completo da fonteAlgebraic combinatorics is the research field that uses combinatorial methods and algorithms to study algebraic computation, and applies algebraic tools to combinatorial problems. One of the central topics of algebraic combinatorics is the study of permutations, interpreted in many different ways (as bijections, permutation matrices, words over integers, total orders on integers, vertices of the permutahedron…). This rich diversity of perspectives leads to the following generalizations of the symmetric group. On the geometric side, the symmetric group generated by simple transpositions is the canonical example of finite reflection groups, also called Coxeter groups. On the monoidal side, the simple transpositions become bubble sort operators that generate the 0-Hecke monoid, whose algebra is the specialization at q=0 of Iwahori’s q-deformation of the symmetric group. This thesis deals with two further generalizations of permutations. In the first part of this thesis, we first focus on partial permutations matrices, that is placements of pairwise non attacking rooks on a n by n chessboard, simply called rooks. Rooks generate the rook monoid, a generalization of the symmetric group. In this thesis we introduce and study the 0-Rook monoid, a generalization of the 0-Hecke monoid. Its algebra is a proper degeneracy at q = 0 of the q-deformed rook monoid of Solomon. We study fundamental monoidal properties of the 0-rook monoid (Green orders, lattice property of the R-order, J-triviality) which allow us to describe its representation theory (simple and projective modules, projectivity on the 0-Hecke monoid, restriction and induction along an inclusion map).Rook monoids are actually type A instances of the family of Renner monoids, which are completions of the Weyl groups (crystallographic Coxeter groups) for Zariski’s topology. In the second part of this thesis we extend our type A results to define and give a presentation of 0-Renner monoids in type B and D. This also leads to a presentation of the Renner monoids of type B and D, correcting a misleading presentation that appeared earlier in the litterature. As in type A we study the monoidal properties of the 0-Renner monoids of type B and D : they are still J-trivial but their R-order are not lattices anymore. We study nonetheless their representation theory and the restriction of projective modules over the corresponding 0-Hecke monoids. The third part of this thesis deals with different generalizations of permutations. In a recent series of papers, Châtel, Pilaud and Pons revisit the algebraic combinatorics of permutations (weak order, Malvenuto-Reutenauer Hopf algebra) in terms of the combinatorics of integer posets. This perspective encompasses as well the combinatorics of quotients of the weak order such as binary trees, binary sequences, and more generally the recent permutrees of Pilaud and Pons. We generalize the weak order on the elements of the Weyl groups. This enables us to describe the order on vertices of the permutahedra, generalized associahedra and cubes in the same unified context. These results are based on subtle properties of sums of roots in Weyl groups, and actually fail for non-crystallographic Coxeter groups
Fenner, Peter. "Some algorithmic problems in monoids of Boolean matrices". Thesis, University of Manchester, 2018. https://www.research.manchester.ac.uk/portal/en/theses/some-algorithmic-problems-in-monoids-of-boolean-matrices(d9cc2975-fa24-42c9-8505-5accaaa2a73e).html.
Texto completo da fonteEmtander, Eric. "Chordal and Complete Structures in Combinatorics and Commutative Algebra". Doctoral thesis, Stockholms universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-48241.
Texto completo da fonteCervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues". Doctoral thesis, Università degli studi di Trento, 2003. http://hdl.handle.net/11572/311140.
Texto completo da fonteCervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues". Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.
Texto completo da fonteCervetti, Matteo. "Pattern posets: enumerative, algebraic and algorithmic issues". Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/311152.
Texto completo da fonteDizona, Jill. "On Algorithmic Fractional Packings of Hypergraphs". Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4029.
Texto completo da fontePépin, Martin. "Quantitative and algorithmic analysis of concurrent programs". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS450.
Texto completo da fonteIn this thesis, we study the state space of concurrent programs using the tools from analytic combinatorics. In a first part, we analyse a class of programs featuring parallelism, non-deterministic choices, loops and a fork-join style of synchronisation. For this class, we propose quantitative results regarding the explosion of the state space as well as efficient algorithmic tools for the uniform random generation of executions. In a second part, we study a new class of directed acyclic graphs whose purpose is to approximate partial orders, which are themselves a good model for the control flow of concurrent programs. For this class, we develop an efficient uniform random sampler of graphs with a given number of edges and vertices. Finally, we also study algorithmic and practical aspects of random generation in general whose field of application goes beyond the scope of concurrency
Virmaux, Aladin. "Théorie des représentations combinatoire de tours de monoïdes : Application à la catégorification et aux fonctions de parking". Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS138/document.
Texto completo da fonteThis thesis is focused on combinatorical representation theory of finitemonoids within the field of algebraic combinatorics.A monoid $M$ is a finite set endowed with a multiplication and a neutralelement. A representation of $M$ is a morphism from $M$ into the monoid ofmatrices $M_n(ck)$ where $ck$ is a field; in this work it will typically bereferred to as $ck = CC$.The results obtained in the last decades allows us to use representation theoryof groups, and combinatorics on preorders in order to explore representationtheory of finite monoides.In 1996, Krob and Thibon proved that the induction and restriction rules ofirreducible and projective representations of the tower of $0$-Hecke monoidsendows its ring of caracters with a Hopf algebra structure, isomorph to thenon-commutative symmetric functions Hopf algebra $ncsf$. This gives acategorification of $ncsf$, which is an interpretation of the non-commutativesymmetruc functions in the language of representation theory. This extends atheorem of Frobenius endowing the character ring of symmetric groups to theHopf algebra of symmetric functions. Since then a natural problem is tocategorify other Hopf algebras -- for instance the Planar Binary Tree algebraof Loday and Ronco -- by a tower of algebras.Guessing such a tower of algebra is a difficult problem in general.In this thesis we restrict ourselves to towers of monoids in order to have abetter control on its representations. This is quite natural as on one hand,this setup covers both previous fundamental examples, whereas $ncsf$cannot be categorified in the restricted set of tower of group algebras.In the first part of this work, we start with some results about representationtheory of towers of monoids. We then focus on categorification with towers ofsemilatices, for example the tower of permutohedrons. We categorify thealgebra, and cogebra structure of $fqsym$, but not the full Hopf algebrastructure with its dual. We then make a comprehensive search in order tocategorify $pbt$ with a tower of monoids. We show that under naturalhypothesis, there exists no tower of monoids satisfying the categorificationaxioms. Finally we show that in some sense, the tower of $0$-Hecke monoids isthe simplest tower categorifying $ncsf$.The second part of this work deals with parking functions, applying resultsfrom the first part. We first study the representation theory of non decreasingparking functions. We then present a joint work with Jean-Baptiste Priez on ageneralization of parking functions from Pitman and Stanley. To obtainenumeration formulas, we use a variant of the species theory which was moreefficient in our case.We used an action of $H_n(0)$ instead of the symmetric group and use theKrob-Thibon theorem to lift the character of this action into the Hopf algebraof non-commutative symmetric functions
Livros sobre o assunto "Algorithmic and combinatorics of monoids"
Lladser, Manuel E., Robert S. Maier, Marni Mishna e Andrew Rechnitzer, eds. Algorithmic Probability and Combinatorics. Providence, Rhode Island: American Mathematical Society, 2010. http://dx.doi.org/10.1090/conm/520.
Texto completo da fonteMelczer, Stephen. Algorithmic and Symbolic Combinatorics. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67080-1.
Texto completo da fonteCan, Mahir, Zhenheng Li, Benjamin Steinberg e Qiang Wang, eds. Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0938-4.
Texto completo da fontePillwein, Veronika, e Carsten Schneider, eds. Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44559-1.
Texto completo da fonteKlin, Mikhail, Gareth A. Jones, Aleksandar Jurišić, Mikhail Muzychuk e Ilia Ponomarenko, eds. Algorithmic Algebraic Combinatorics and Gröbner Bases. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01960-9.
Texto completo da fonteAlgorithmic algebraic combinatorics and Gröbner bases. Heidelberg: Springer, 2009.
Encontre o texto completo da fonteCalude, Cristian S. Information and Randomness: An Algorithmic Perspective. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002.
Encontre o texto completo da fonteHabib, Michel. Probabilistic Methods for Algorithmic Discrete Mathematics. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998.
Encontre o texto completo da fonteLongueville, Mark. A Course in Topological Combinatorics. New York, NY: Springer New York, 2013.
Encontre o texto completo da fonteLinda, Pagli, e Steel Graham 1977-, eds. Mathematical and algorithmic foundations of the internet. Boca Raton, Fla: Chapman & Hall/CRC Press, 2011.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Algorithmic and combinatorics of monoids"
Li, Zhenheng, Zhuo Li e You’an Cao. "Algebraic Monoids and Renner Monoids". In Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics, 141–87. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0938-4_7.
Texto completo da fonteHenckell, Karsten, e Jean-Eric Pin. "Ordered Monoids and J-Trivial Monoids". In Algorithmic Problems in Groups and Semigroups, 121–37. Boston, MA: Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4612-1388-8_6.
Texto completo da fonteNešetřil, Jaroslav, e Patrice Ossona de Mendez. "Algorithmic Applications". In Algorithms and Combinatorics, 397–410. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27875-4_18.
Texto completo da fonteDress, A., O. Delgado Friedrichs e D. Huson. "An Algorithmic Approach to Tilings". In Combinatorics Advances, 111–19. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4613-3554-2_7.
Texto completo da fonteMelczer, Stephen. "Automated Analytic Combinatorics". In Algorithmic and Symbolic Combinatorics, 263–304. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-67080-1_7.
Texto completo da fonteBrion, Michel. "On Algebraic Semigroups and Monoids". In Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics, 1–54. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0938-4_1.
Texto completo da fonteRaymond, Jean-François, Pascal Tesson e Denis Thérien. "Multiparty Communication Complexity of Finite Monoids". In Algorithmic Problems in Groups and Semigroups, 217–33. Boston, MA: Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4612-1388-8_12.
Texto completo da fonteMolloy, Michael, e Bruce Reed. "Algorithmic Aspects of the Local Lemma". In Algorithms and Combinatorics, 295–313. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-04016-0_25.
Texto completo da fonteMelczer, Stephen. "Introduction". In Algorithmic and Symbolic Combinatorics, 1–18. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-67080-1_1.
Texto completo da fonteMelczer, Stephen. "Application: Lattice Paths, Revisited". In Algorithmic and Symbolic Combinatorics, 387–405. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-67080-1_10.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Algorithmic and combinatorics of monoids"
Mishna, Marni. "Algorithmic Approaches for Lattice Path Combinatorics". In ISSAC '17: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3087604.3087664.
Texto completo da fonteGiotis, Ioannis, Lefteris Kirousis, Kostas I. Psaromiligkos e Dimitrios M. Thilikos. "On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring". In 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973761.2.
Texto completo da fonteBognar, Melinda. "From Intuition to Randomness: Combinatorics as Architectural Design Methodology in the Wave Function Collapse Algorithm". In Design Computation Input/Output 2021. Design Computation, 2021. http://dx.doi.org/10.47330/dcio.2021.zpdw5322.
Texto completo da fonte