Related papers: Flag Algebras: A First Glance
The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
We prove several combinatorial results on path algebras over discrete structures related to directed graphs. These results are motivated by Morse theory on a manifold with boundary and, more generally, by Floer theory on a configuration…
An edge-colored graph is said to be rainbow if all its edges have distinct colors. In this paper, we study the rainbow analogue of a fundamental result of Mader [\emph{Math. Ann.} \textbf{174} (1967), 265--268] on the existence of…
We give an upper bound for the index of certain Lie algebras, called of seaweed type, introduced by V. Dergachev, A. Kirillov and D. Panyushev. We deduce from this a conjecture of D. Panyushev stated in "Inductive formulas for the index of…
According to Paul Erd\H{o}s [Some notes on Tur\'an's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur\'an who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd\H{o}s…
The theory of path homology for digraphs was developed by Alexander Grigor'yan, Yong Lin, Yuri Muranov, and Shing-Tung Yau. In this paper, we consider the differential algebras on digraphs and define the parametrized homology of digraphs as…
In this paper, we investigate the packing parameters in graphs. By applying the Mantel's theorem, We give upper bounds on packing and open packing numbers of triangle-free graphs along with characterizing the graphs for which the equalities…
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density $i(\vec P_3)$ of the orgraph $\vec P_3$ in an arbitrary orgraph. A conjecture of Thomass\'e states that $i(\vec P_3)=2/5$. The hitherto…
The first part of this thesis deals with certain properties of the quantum symmetric and exterior algebras of Type 1 representations of $U_q(g)$ defined by Berenstein and Zwicknagl. We define a notion of a commutative algebra object in a…
We study simple Lie algebras generated by extremal elements, over arbitrary fields of arbitrary characteristic. We show: (1) If the extremal geometry contains lines, then the Lie algebra admits a $5 \times 5$-grading that can be…
In this article algorithmic methods are presented that have essentially been introduced into computer algebra systems like Mathematica within the last decade. The main ideas are due to Stanley and Zeilberger. Some of them had already been…
This book is expository and is in Russian. It is shown how in the course of solution of interesting geometric problems (close to applications) naturally appear main notions of algebraic topology (homology groups, obstructions and…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
We establish a sharp upper bound on the number of properly $3$-edge-colored $K_4$'s in graphs with $R$ red, $G$ green and $B$ blue edges. We give a computer-free flag-algebra proof of this bound, and we also convert our proof into a…
In this paper, oppositeness in spherical buildings is used to define an EKR-problem for flags in projective and polar spaces. A novel application of the theory of buildings and Iwahori-Hecke algebras is developed to prove sharp upper bounds…
We prove the conjecture by Feigin, Fuchs and Gelfand describing the Lie algebra cohomology of formal vector fields on an $n$-dimensional space with coefficients in symmetric powers of the coadjoint representation. We also compute the…
In this paper, we take advantage of a reinterpretation of differential modules admitting a flag structure as a special class of perturbations of complexes. We are thus able to leverage the machinery of homological perturbation theory to…