Academic literature on the topic 'Lattices and Combinatorics'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lattices and Combinatorics.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Lattices and Combinatorics"
Mühle, Henri. "Noncrossing Arc Diagrams, Tamari Lattices, and Parabolic Quotients of the Symmetric Group." Annals of Combinatorics 25, no. 2 (April 10, 2021): 307–44. http://dx.doi.org/10.1007/s00026-021-00532-9.
Full textClingher, Adrian, and Jae-Hyouk Lee. "Lorentzian Lattices and E-Polytopes." Symmetry 10, no. 10 (September 28, 2018): 443. http://dx.doi.org/10.3390/sym10100443.
Full textMühle, Henri. "Hochschild lattices and shuffle lattices." European Journal of Combinatorics 103 (June 2022): 103521. http://dx.doi.org/10.1016/j.ejc.2022.103521.
Full textBaranovskii, Evgenii, and Viatcheslav Grishukhin. "Non-rigidity Degree of a Lattice and Rigid Lattices." European Journal of Combinatorics 22, no. 7 (October 2001): 921–35. http://dx.doi.org/10.1006/eujc.2001.0510.
Full textCuntz, Michael, Sophia Elia, and Jean-Philippe Labbé. "Congruence Normality of Simplicial Hyperplane Arrangements via Oriented Matroids." Annals of Combinatorics 26, no. 1 (November 8, 2021): 1–85. http://dx.doi.org/10.1007/s00026-021-00555-2.
Full textElekes, György. "On Linear Combinatorics III. Few Directions and Distorted Lattices." Combinatorica 19, no. 1 (January 1, 1999): 43–53. http://dx.doi.org/10.1007/s004930050044.
Full textVaderlind, Paul. "Clutters and Atomistic Lattices." European Journal of Combinatorics 7, no. 4 (October 1986): 389–96. http://dx.doi.org/10.1016/s0195-6698(86)80010-5.
Full textNimbhorkar, Shriram K., and Deepali B. Banswal. "Generalizations of supplemented lattices." AKCE International Journal of Graphs and Combinatorics 16, no. 1 (April 1, 2019): 8–17. http://dx.doi.org/10.1016/j.akcej.2018.02.005.
Full textLeoreanu-Fotea, Violeta, and Ivo G. Rosenberg. "Hypergroupoids determined by lattices." European Journal of Combinatorics 31, no. 3 (April 2010): 925–31. http://dx.doi.org/10.1016/j.ejc.2009.06.005.
Full textDeza, Antoine, and Shmuel Onn. "Solitaire Lattices." Graphs and Combinatorics 18, no. 2 (May 1, 2002): 227–43. http://dx.doi.org/10.1007/s003730200016.
Full textDissertations / Theses on the topic "Lattices and Combinatorics"
Xin, Yuxin. "Strongly Eutactic Lattices From Vertex Transitive Graphs." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/cmc_theses/2171.
Full textGoodwin, Michelle. "Lattices and Their Application: A Senior Thesis." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1317.
Full textUsatine, Jeremy. "Arithmetical Graphs, Riemann-Roch Structure for Lattices, and the Frobenius Number Problem." Scholarship @ Claremont, 2014. http://scholarship.claremont.edu/hmc_theses/57.
Full textAlexander, Matthew R. "Combinatorial and Discrete Problems in Convex Geometry." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1508949236617778.
Full textKrohne, Edward. "Continuous Combinatorics of a Lattice Graph in the Cantor Space." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc849680/.
Full textHeuer, Manuela. "Combinatorial aspects of root lattices and words." Thesis, Open University, 2010. http://oro.open.ac.uk/24046/.
Full textYoon, Young-jin. "Characterizations of Some Combinatorial Geometries." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc277894/.
Full textMelczer, Stephen. "Analytic Combinatorics in Several Variables : Effective Asymptotics and Lattice Path Enumeration." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN013/document.
Full textThe field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through analytic properties of their generating functions, has led to thedevelopment of deep and powerful tools with applications across mathematics and thenatural sciences. In addition to the now classical univariate theory, recent work in thestudy of analytic combinatorics in several variables (ACSV) has shown how to deriveasymptotics for the coefficients of certain D-finite functions represented by diagonals ofmultivariate rational functions. This thesis examines the methods of ACSV from acomputer algebra viewpoint, developing rigorous algorithms and giving the firstcomplexity results in this area under conditions which are broadly satisfied.Furthermore, this thesis gives several new applications of ACSV to the enumeration oflattice walks restricted to certain regions. In addition to proving several openconjectures on the asymptotics of such walks, a detailed study of lattice walk modelswith weighted steps is undertaken
Davis, Brian. "Lattice Simplices: Sufficiently Complicated." UKnowledge, 2019. https://uknowledge.uky.edu/math_etds/60.
Full textGay, 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.
Full textAlgebraic 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
Books on the topic "Lattices and Combinatorics"
Gerhard, Gierz, ed. Continuous lattices and domains. Cambridge, U.K: Cambridge University Press, 2003.
Find full textAndrews, George E., Christian Krattenthaler, and Alan Krinik, eds. Lattice Path Combinatorics and Applications. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-11102-1.
Full textConway, John Horton. Sphere packings, lattices, and groups. 3rd ed. New York: Springer, 1999.
Find full textConway, John Horton. Sphere packings, lattices, and groups. New York: Springer-Verlag, 1988.
Find full textA, Sloane N. J., ed. Sphere Packings, Lattices and Groups. New York, NY: Springer New York, 1988.
Find full textConway, John Horton. Sphere packings, lattices, and groups. 2nd ed. New York: Springer-Verlag, 1993.
Find full text1951-, Terao Hiroaki, ed. Arrangements of hyperplanes. Berlin: Springer-Verlag, 1992.
Find full text1951-, Terao Hiroaki, ed. Arrangements and hypergeometric integrals. Tokyo: Mathematical Society of Japan, 2001.
Find full textMartinet, Jacques. Les Réseaux parfaits des espaces euclidiens. Paris: Masson, 1996.
Find full textOrlik, Peter. Introduction to arrangements. Providence, R.I: Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, 1989.
Find full textBook chapters on the topic "Lattices and Combinatorics"
Deza, Michel Marie, and Monique Laurent. "Preliminaries on Lattices." In Algorithms and Combinatorics, 175–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-04295-9_13.
Full textKung, Joseph P. S. "Combinatorics in finite lattices." In Lattice Theory: Special Topics and Applications, 195–229. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06413-0_6.
Full textKříž, Igor. "On Order-Perfect Lattices." In Algorithms and Combinatorics, 409–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60406-5_35.
Full textCrapo, Henry H. "Möbius Inversion in Lattices." In Classic Papers in Combinatorics, 403–15. Boston, MA: Birkhäuser Boston, 2009. http://dx.doi.org/10.1007/978-0-8176-4842-8_29.
Full textGeissinger, Ladnor. "Valuations on Distributive Lattices I." In Classic Papers in Combinatorics, 462–71. Boston, MA: Birkhäuser Boston, 2009. http://dx.doi.org/10.1007/978-0-8176-4842-8_37.
Full textGeissinger, Ladnor. "Valuations on Distributive Lattices II." In Classic Papers in Combinatorics, 473–81. Boston, MA: Birkhäuser Boston, 2009. http://dx.doi.org/10.1007/978-0-8176-4842-8_38.
Full textGeissinger, Ladnor. "Valuations on Distributive Lattices III." In Classic Papers in Combinatorics, 483–89. Boston, MA: Birkhäuser Boston, 2009. http://dx.doi.org/10.1007/978-0-8176-4842-8_39.
Full textBerman, Joel. "On the Combinatorics of Free Algebras." In Lattices, Semigroups, and Universal Algebra, 13–19. Boston, MA: Springer US, 1990. http://dx.doi.org/10.1007/978-1-4899-2608-1_2.
Full textDeza, Michel Marie, and Monique Laurent. "Cut Lattices, Quasi h-Distances and Hilbert Bases." In Algorithms and Combinatorics, 381–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-04295-9_25.
Full textDeza, Michel Marie, and Monique Laurent. "L 1-Metrics from Lattices, Semigroups and Normed Spaces." In Algorithms and Combinatorics, 105–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-04295-9_8.
Full textConference papers on the topic "Lattices and Combinatorics"
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.
Full textBanderier, Cyril, and Michael Wallner. "Lattice paths of slope 2/5." 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.10.
Full textUnger, Wolfgang. "The Combinatorics of Lattice QCD at Strong Coupling." In The 32nd International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2015. http://dx.doi.org/10.22323/1.214.0192.
Full textBhakta, Prateek, and Dana Randall. "Sampling Weighted Perfect Matchings on the Square-Octagon Lattice." In 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974324.5.
Full textBernasconi, Anna, Antonio Boffa, Fabrizio Luccio, and Linda Pagli. "Two Combinatorial Problems on the Layout of Switching Lattices." In 2018 IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC). IEEE, 2018. http://dx.doi.org/10.1109/vlsi-soc.2018.8644855.
Full textKasparian, Azniv. "Riemann-Roch Theorem and Mac Williams identities for an additive code with respect to a saturated lattice." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383243.
Full textBuermann, Jan, and Jie Zhang. "Multi-Robot Adversarial Patrolling Strategies via Lattice Paths." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/582.
Full textLEE, EDMOND W. H., and M. V. VOLKOV. "ON THE STRUCTURE OF THE LATTICE OF COMBINATORIAL REES–SUSHKEVICH VARIETIES." In Proceedings of the International Conference. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812708700_0012.
Full textPappi, Koralia N., Nestor D. Chatzidiamantis, and George K. Karagiannidis. "A combinatorial geometrical approach to the error performance of multidimensional finite lattice constellations." In 2012 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2012. http://dx.doi.org/10.1109/wcnc.2012.6214435.
Full textCallanan, Jesse, Oladapo Ogunbodede, Maulikkumar Dhameliya, Jun Wang, and Rahul Rai. "Hierarchical Combinatorial Design and Optimization of Quasi-Periodic Metamaterial Structures." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85914.
Full text