Results 51 to 60 of about 55,778 (257)
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
Journal of Combinatorial Designs, EarlyView.ABSTRACT A family ℱ ${\rm{ {\mathcal F} }}$ of subsets of [ n ] = { 1 , 2 , … , n } $[n]=\{1,2,\ldots ,n\}$ shatters a set A ⊆ [ n ] $A\subseteq [n]$ if for every A ′ ⊆ A ${A}^{^{\prime} }\subseteq A$, there is an F ∈ ℱ $F\in {\rm{ {\mathcal F} }}$ such that F ∩ A = A ' $F\cap A={A}^{\text{'}}$.
Noga Alon +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
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, EarlyView.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
Triangular arrangements on the projective plane [PDF]
Épijournal de Géométrie Algébrique, 2023 In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a Roots-of-Unity-Arrangement ...
Simone Marchesi, Jean Vallès
doaj
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
The weak Lefschetz property for artinian Gorenstein algebras
Bulletin of the London Mathematical Society, EarlyView.Abstract It is an extremely elusive problem to determine which standard artinian graded K$K$‐algebras satisfy the weak Lefschetz property (WLP). Codimension 2 artinian Gorenstein graded K$K$‐algebras have the WLP and it is open to what extent such result might work for codimension 3 artinian Gorenstein graded K$K$‐algebras.
Rosa M. Miró‐Roig
wiley +1 more source
Indiscernibles in monadically NIP theories
Bulletin of the London Mathematical Society, EarlyView.Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley +1 more source