Results 81 to 90 of about 305,985 (193)
The many faces of modern combinatorics [PDF]
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including algebraic geometry), topology, probability theory, and theoretical computer science.
arxiv
Combinatorics of Type D Exceptional Sequences [PDF]
Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We combinatorially classify exceptional sequences of a family of type D Dynkin quivers, and we show how our model for ...
arxiv
Basilica: New canonical decomposition in matching theory
Abstract In matching theory, one of the most fundamental and classical branches of combinatorics, canonical decompositions of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known canonical decompositions, that is, the Dulmage–Mendelsohn, Kotzig–Lovász, and Gallai–Edmonds decompositions, are ...
Nanao Kita
wiley +1 more source
The objective of this research is to describe the improvement of the competence of Olympic workshop participants in problem-solving of mathematics Olympiad for mathematics teachers of Junior High Schools in the Madiun Regency by using the qualitative ...
Mohammad Tohir
doaj +1 more source
A Review of Modern Multinomial‐Derived and Partition‐Based Record‐Linkage Methods
ABSTRACT Fellegi and Sunter introduced in 1969 the first theory of record linkage. Their work was interpreted and applied in many situations. However, an infrastructure to support generalizing the theory was not available until 40 years later when Sadinle and Fienberg formally introduced partitioning in the record linkage arena.
Yves Thibaudeau
wiley +1 more source
On minimal presentations of numerical monoids
Abstract We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing this problem, we apply tools from Hilbert functions and free resolutions of artinian standard graded ...
Alessio Moscariello, Alessio Sammartano
wiley +1 more source
Valued Graphs and the Representation Theory of Lie Algebras
Quivers (directed graphs), species (a generalization of quivers) and their representations play a key role in many areas of mathematics including combinatorics, geometry, and algebra.
Joel Lemay
doaj +1 more source
Five interpretations of Faà di Bruno's formula [PDF]
In these lectures we present five interpretations of the Fa' di Bruno formula which computes the n-th derivative of the composition of two functions of one variable: in terms of groups, Lie algebras and Hopf algebras, in combinatorics and within operads.
arxiv
The Combinatorics of Iterated Loop Spaces
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads.
Batanin, M. A.
core +1 more source
The Shi variety corresponding to an affine Weyl group
Abstract Let W$W$ be an irreducible Weyl group and Wa$W_a$ its affine Weyl group. In this article we show that there exists a bijection between Wa$W_a$ and the integral points of an affine variety, denoted X̂Wa$\widehat{X}_{W_a}$, which we call the Shi variety of Wa$W_a$.
Nathan Chapelier‐Laget
wiley +1 more source