Related papers: Flag Algebras: A First Glance
We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
In this survey, we review some of the recent connections between the representation theory of (untwisted) quantum affine algebras and the representation theory of current algebras. We mainly focus on the finite-dimensional representations…
The rise of Artificial Intelligence (AI) recently empowered researchers to investigate hard mathematical problems which eluded traditional approaches for decades. Yet, the use of AI in Universal Algebra (UA) -- one of the fields laying the…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
In his 1999 preprint "Universal Lie Algebra", P. Vogel put forward a hypothesis on the existence of a universal Lie algebra. Although this hypothesis remains open, it is known that many quantities in Lie theory admit universal descriptions.…
The earlier work of the first and the third named authors introduced the algebra $\mathbb{A}_{q,t}$ and its polynomial representation. In this paper we construct an action of this algebra on the equivariant K-theory of certain smooth strata…
In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general…
We propose a combinatorial approach to the following strengthening of Gal's conjecture: $\gamma(\Delta)\ge \gamma(E)$ coefficientwise, where $\Delta$ is a flag homology sphere and $E\subseteq \Delta$ an induced homology sphere of…
The $(\kappa,\ell)$-edge-inducibility problem asks for the maximum number of $\kappa$-subsets inducing exactly $\ell$ edges that a graph of given order $n$ can have. Using flag algebras and stability approach, we resolve this problem for…
The Littelmann path moel gives a realization of the crystals of integrable representations of symmetrizable Kac-Moody Lie algebras. Recent work of Gaussent-Littelmann and others has demonstrated a connection between this model and the…
Condition (Fg) was introduced in [6] to ensure that the theory of support varieties of a finite dimensional algebra, established by Snashall and Solberg, has some similar properties to that of a group algebra. In this paper we give some…
We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of $K_n$ is bipartite. A sparse version of Mantel's Theorem is that, for sufficiently large $p$, every maximum…
We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities…