Related papers: Combinatorial methods: from groups to polynomial a…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
In recent years, the intersection of algebra, geometry, and combinatorics with particle physics and cosmology has led to significant advances. Central to this progress is the twofold formulation of the study of particle interactions and…
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…
We consider $\G$-graded commutative algebras, where $\G$ is an abelian group. Starting from a remarkable example of the classical algebra of quaternions and, more generally, an arbitrary Clifford algebra, we develop a general viewpoint on…
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to…
Combinators were a key idea in the development of mathematical logic and the emergence of the concept of universal computation. They were introduced on December 7, 1920, by Moses Sch\"onfinkel. This is an exploration of the personal story…
The theory of Groebner Bases originated in the work of Buchberger and is now considered to be one of the most important and useful areas of symbolic computation. A great deal of effort has been put into improving Buchberger's algorithm for…
The seminal concept of characteristic polygon of an embedded algebroid surface, first developed by Hironaka, seems well suited for combinatorially (perhaps even effectively) tracking of a resolution process. However, the way this object…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
In a preprint released in 2016, Daniel Grayson introduces a conjectural presentation of the (higher) relative algebraic $K$-groups using purely combinatorial means. In this paper, we will show that this presentation is isomorphic to the…
Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…
The concept of Central sets, introduced by Furstenberg through the framework of topological dynamics, has played a pivotal role in combinatorial number theory. Furstenberg's Central Sets Theorem highlighted their rich combinatorial…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
We systematize and analyze some results obtained in Subset Combinatorics of $G$ groups after publications the previous surveys [1-4]. The main topics: the dynamical and descriptive characterizations of subsets of a group relatively their…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…