Results 61 to 70 of about 3,991 (224)
Journal of Combinatorial Designs, EarlyView.ABSTRACT Capsets are subsets of F 3 n ${{\mathbb{F}}}_{3}^{n}$ with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3 ${{\mathbb{F}}}_{3}$.
Cassie Grace, José Felipe Voloch
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.4A [PDF]
, 2010 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +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
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
On Matrix‐Based Cryptography Using Matrix Norm and Special Integer Sequences
Mathematische Nachrichten, EarlyView.ABSTRACT In this paper, a novel matrix‐based encryption approach based on the Affine Hill cipher is presented. The key matrix is constructed using the Narayana integer sequence, and the Frobenius norm of the key matrix is used as a scaling factor in the key construction.
Melih Göcen +1 more
wiley +1 more source
Operads in algebraic combinatorics
CoRR, 2017 The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying algebraically the structures thus obtained (changes of bases, generating sets, presentations, morphisms ...
openaire +2 more sources
International Journal of Mathematical Combinatorics, Vol.1 [PDF]
, 2007 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +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
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
Algebraic combinatorics in bounded induction [PDF]
Annals of Pure and Applied Logic, 2021 In this paper, new methods for analyzing models of weak subsystems of Peano Arithmetic are proposed. The focus will be on the study of algebro-combinatoric properties of certain definable cuts. Their relationship with segments that satisfy more induction, with those limited by the standard powers/roots of an element, and also with definable sets in ...
openaire +4 more sources