Results 71 to 80 of about 169,932 (295)
Coxeter-biCatalan combinatorics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider several counting problems related to Coxeter-Catalan combinatorics and conjecture that the problems all have the same answer, which we call the $W$ -biCatalan number. We prove the conjecture in many cases.
Emily Barnard, Nathan Reading
doaj +1 more source
, 2018 This monograph aims to promote original mathematical methods to determine the invariant measure of two-dimensional random walks in domains with boundaries.
G. Fayolle +2 more
semanticscholar +1 more source
The implications of generative artificial intelligence for mathematics education
School Science and Mathematics, EarlyView.Abstract Generative artificial intelligence has become prevalent in discussions of educational technology, particularly in the context of mathematics education. These AI models can engage in human‐like conversation and generate answers to complex questions in real‐time, with education reports accentuating their potential to make teachers' work more ...
Candace Walkington
wiley +1 more source
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source
Enumeration of three term arithmetic progressions in fixed density sets [PDF]
, 2014 Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different techniques.
Sjöland, Erik
core
Combinatorics of Positroids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Recently Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroids.
Suho Oh
doaj +1 more source
On stabilizers in finite permutation groups
Bulletin of the London Mathematical Society, EarlyView.Abstract Let G$G$ be a permutation group on the finite set Ω$\Omega$. We prove various results about partitions of Ω$\Omega$ whose stabilizers have good properties. In particular, in every solvable permutation group there is a set‐stabilizer whose orbits have length at most 6, which is best possible and answers two questions of Babai.
Luca Sabatini
wiley +1 more source
Incidence combinatorics of resolutions
, 2000 We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of subspace ...
Dmitry, Eva-maria Feichtner, N. Kozlov
core +4 more sources
Teaching of probability theory and combinatorics at secondary schools
Lietuvos Matematikos Rinkinys, 2004 The topics of probability theory and combinatorics were brought into curricula of Lithuanian secondary schools ten years ago. The problems of teaching and actual situation of apprehension of concepts of probability theory and combinatorics are analyzed.
Eugenijus Stankus
doaj +3 more sources