Related papers: Laver tables and combinatorics
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
A double algebra is a linear space $V$ equipped with linear map $V\otimes V\to V\otimes V$. Additional conditions on this map lead to the notions of Lie and associative double algebras. We prove that simple finite-dimensional Lie double…
This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.
Understanding the notion of a model is not always easy in logic courses. Hence, tools such as Euler diagrams are frequently applied as informal illustrations of set-theoretical models. We formally investigate Euler diagrams as an…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
We describe two new combinatorial algorithms (using the language of "triangular arrays") for computing the Fourier transforms of simple perverse sheaves on the moduli space of representations of an equioriented quiver of type A. (A rather…
A VB-algebroid is essentially defined as a Lie algebroid object in the category of vector bundles. There is a one-to-one correspondence between VB-algebroids and certain flat Lie algebroid superconnections, up to a natural notion of…
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. One of the main reasons for this growth is the tight…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
We consider analysis of relational data (a matrix), in which the rows correspond to subjects (e.g., people) and the columns correspond to attributes. The elements of the matrix may be a mix of real and categorical. Each subject and…
Ferrers graphs and tables of partitions are treated as vectors. Matrix operations are used for simple proofs of identities concerning partitions. Interpreting partitions as vectors gives a possibility to generalize partitions on negative…
Relative algebroids provide a framework that unifies Lie algebroids with partial differential equations. In this set of notes, we explain how relative algebroids arise from geometric problems, and give an introduction to their structural…
A barred preferential arrangement is a preferential arrangement onto which a number of identical bars are inserted in between the blocks of the preferential arrangement. In this study we examine combinatorial properties of barred…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…