相关论文: MAT-Freeness is not combinatorial
We describe a structure of PRO on hypermatrices. This structure allows us to define multilinear representations of PROs and in particular of free Pros. As an example of applications, we investigate the relations of the representations of…
In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we…
In this series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems.
Suppose that W is a finite, unitary, reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. Let L(A) be the…
We give a nonrecursive, combinatorial characterization of multiplicity-free products of Grassmannian Schubert classes. This answers a question of W. Fulton and extends results of J. Stembridge.
Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Terao's factorization theorem shows that if an arrangement is free, then its characteristic polynomial factors into the product of linear polynomials over the integer ring. This is not a necessary condition, but there are not so many…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…
As is well-known, the homology groups of the complement of a complex hyperplane arrangement are torsion-free. Nevertheless, as we showed in a recent paper [arXiv:1209.3414] the homology groups of the Milnor fiber of such an arrangement can…
We construct a finite-dimensional metabelian right-symmetric algebra over an arbitrary field that does not have a finite basis of identities.
We consider free multiple stochastic measures in the combinatorial framework of the lattice of all diagonals of an n-dimensional space. In this free case, one can restrict the analysis to only the noncrossing diagonals. We give definitions…
The main purpose of this paper is to provide combinatorial constraints on the constructability of free and nearly free arrangements of smooth plane conics admitting certain ${\rm ADE}$ singularites.
A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…
We study the classes of free and plus-one generated hyperplane arrangements. Specifically, we describe how to compute the associated prime ideals of the Jacobian ideal of such an arrangement from its lattice of intersection. Moreover, we…
We present the recent developments in the studies of the structure of hadron resonances, focusing on the compositeness in terms of the hadronic degrees of freedom. We discuss the model dependence of the compositeness, and show that the…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…