Results 31 to 40 of about 11,862 (202)
Enumeration of simple random walks and tridiagonal matrices
We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted ...
Bauer M +23 more
core +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source
Promotion of Lattice Paths by Riordan Arrays
This paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy +3 more
doaj +1 more source
Transitive factorizations of permutations and geometry [PDF]
We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of curves.
Goulden, I. P., Jackson, D. M.
core
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Structure and Combinatorics on Right Groups
Right groups form an important bridge between group theory and semigroup theory, combining the algebraic symmetry of groups with the one-sided structure of right zero semigroups.
Aftab Hussain Shah +2 more
doaj +1 more source
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Assaf, Sami H.
core +3 more sources
Simple 3‐Designs of PSL ( 2 , 2 n ) With Block Size 13
ABSTRACT This paper focuses on the investigation of simple 3‐( 2 n + 1 , 13 , λ ) designs admitting PSL ( 2 , 2 n ) as an automorphism group. Such designs arise from the orbits of 13‐element subsets under the action of PSL ( 2 , 2 n ) on the projective line X = GF ( 2 n ) ∪ { ∞ }, and any union of these orbits also forms a 3‐design.
Takara Kondo, Yuto Nogata
wiley +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
A survey of subdivisions and local $h$-vectors [PDF]
The enumerative theory of simplicial subdivisions (triangulations) of simplicial complexes was developed by Stanley in order to understand the effect of such subdivisions on the $h$-vector of a simplicial complex.
Athanasiadis, Christos A.
core

