Results 51 to 60 of about 56,264 (249)
Asymptotics of lattice walks via analytic combinatorics in several variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider the enumeration of walks on the two-dimensional non-negative integer lattice with steps defined by a finite set S ⊆ {±1, 0}2 . Up to isomorphism there are 79 unique two-dimensional models to consider, and previous work in this area has used ...
Stephen Melczer, Mark C. Wilson
doaj +1 more source
Lattice structure of Grassmann-Tamari orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.
Thomas McConville
doaj +1 more source
Attractiveness of the Haar measure for linear cellular automata on Markov subgroups [PDF]
, 2006 For the action of an algebraic cellular automaton on a Markov subgroup, we show that the Ces\`{a}ro mean of the iterates of a Markov measure converges to the Haar measure.
Maass, Alejandro +3 more
core +4 more sources
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner +2 more
wiley +1 more source
An inverse Grassmannian Littlewood–Richardson rule and extensions
Forum of Mathematics, SigmaChow rings of flag varieties have bases of Schubert cycles $\sigma _u $ , indexed by permutations. A major problem of algebraic combinatorics is to give a positive combinatorial formula for the structure constants of this basis.
Oliver Pechenik, Anna Weigandt
doaj +1 more source
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
Journal of Combinatorial Designs, EarlyView.ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
On the Q $Q$‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure
Journal of Combinatorial Designs, EarlyView.ABSTRACT Let Γ ${\rm{\Gamma }}$ denote a finite, connected graph with vertex set X $X$. Fix x ∈ X $x\in X$ and let ε ≥ 3 $\varepsilon \ge 3$ denote the eccentricity of x $x$. For mutually distinct scalars { θ i * } i = 0 ε ${\{{\theta }_{i}^{* }\}}_{i=0}^{\varepsilon }$ define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) ${A}^
Blas Fernández +3 more
wiley +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
European Journal of Combinatorics, 2010 The present issue of Designs, Codes and Cryptography is devoted to the theme “Geometric and Algebraic Combinatorics”. A central concept in this research area is the Association Scheme. On one hand it can be a tool for a better understanding of combinatorial objects, such as error correcting codes, block designs, point-line incidence geometries, and ...
Edwin van Dam, Willem H. Haemers
openaire +4 more sources