相关论文: Combinatorial methods: from groups to polynomial a…

This research addresses a new tool for data analysis known as Topological Data Analysis TDA It underlies an area of Mathematics known as Combinatorial Algebra or more recently Algebraic Topology which through making strong use of…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

We develop a theory of multigraded (i.e., $N^l$-graded) combinatorial Hopf algebras modeled on the theory of graded combinatorial Hopf algebras developed by Aguiar, Bergeron, and Sottile [Compos. Math. 142 (2006), 1--30]. In particular we…

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…

The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…

For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…

This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…

This study critically analyses the information-theoretic, axiomatic and combinatorial philosophical bases of the entropy and cross-entropy concepts. The combinatorial basis is shown to be the most fundamental (most primitive) of these three…

In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

Modular forms appear in many facets of mathematics, and have played important roles in geometry, mathematical physics, number theory, representation theory, topology, and other areas. Around 1994, motivated by technical issues in homotopy…

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…

Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in…

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…

The evolution from Mobius to gyrogroups began in 1988, and is still ongoing in [14, 15]. Gyrogroups, a natural generalization of groups, lay a fruitful bridge between nonassociative algebra and hyperbolic geometry, just as groups lay a…

Quantum groupoids are a joint generalization of groupoids and quantum groups. We propose a definition of a compact quantum groupoid that is based on the theory of C*-algebras and Hilbert bimodules. The essential point is that whenever one…

We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…