Related papers: Some remarks on combinatorial wall-crossing

In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Kerov's polynomials give irreducible character values in term of the free cumulants of the associated Young diagram. We prove in this article a positivity result on their coefficients, which extends a conjecture of S. Kerov. Our method,…

This chapter presents a state-of-the-art survey of relationships, traditionally referred to as `bridges', between interpolation properties for propositional logics -- including superintuitionistic, modal, and substructural logics -- and…

In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

Motivated by my work on enumerative invariants for Quot schemes, I related two power series obtained by two different means. One of them was computed using geometric arguments via virtual localization methods and the other one came from…

We prove a conjecture of Sturmfels, Timme and Zwiernik on the ML-degrees of linear covariance models in algebraic statistics. As in our previous works on linear concentration models, the proof ultimately relies on the computation of certain…

Modern applications of algebraic topology to point cloud data analysis have motivated active investigation of combinatorial clique complexes -- high-dimensional extensions of combinatorial graphs. We show that meaningful invariants of such…

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…

We use a simple geometric argument and small cancellation properties of link groups to prove that alternating links are non-trivial. This proof uses only classic results in topology and combinatorial group theory.

We investigate the representation theory of the rational and trigonometric Cherednik algebra of type $GL_n$ by means of combinatorics on periodic (or cylindrical) skew diagrams. We introduce and study standard tableaux and plane partitions…

In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…

We present a particular connection between classical partition combinatorics and the theory of quiver representations. Specifically, we give a bijective proof of an analogue of A. L. Cauchy's Durfee square identity to multipartitions. We…

We show that a vast class of finitary fragments of geometric logic admit a form of Craig interpolation property. In doing so, we provide a new dictionary to import technology from algebraic logic to categorical logic.

We give explicit realizations of irreducible representations of the Yangian of the general linear Lie algebra and of its twisted analogues, corresponding to symplectic and orthogonal Lie algebras. In particular, we develop the fusion…

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…

This is the second part of a project concerning variation of stability and chamber structure for ADHM invariants of curves. Wallcrossing formulas for such invariants are derived using the theory of stack function Ringel-Hall algebras…