Related papers: Flag Algebras: A First Glance
In this paper we generalize the comparison theorem of Hecht and Taylor to arbitrary parabolic subalgebras of a complex reductive Lie algebra and then apply our generalized comparison theorem to obtain results about the geometric realization…
The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as…
This text is based on lectures given by authors in summer 2015. It contains an introduction to the theory of limits over the category of presentations, with examples of different well-known functors like homology or derived functors of…
We determine the maximum number of induced copies of a 5-cycle in a graph on $n$ vertices for every $n$. Every extremal construction is a balanced iterated blow-up of the 5-cycle with the possible exception of the smallest level where for…
Very recently, the first geometric-arithmetic index $GA$ and arithmetic-geometric index $AG$ were introduced in mathematical chemistry. In the present paper, we first obtain some lower and upper bounds on $AG$ and characterize the extremal…
Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…
This paper generalizes the classification in a paper of Dimitrov and Penkov of Borel subalgebras of gl_infty. Root-reductive Lie algebras are direct limits of finite-dimensional reductive Lie algebras along inclusions preserving the root…
This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…
Let $E$ be an odd dimensional complex vector space and $\mbox{IF}:=\mbox{IF}(1,2;E)$ be the family of odd symplectic partial flag manifold. In this paper we give a full description of the irreducible components of the degree $d$ curve…
We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…
In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…
A fundamental problem at the confluence of algebraic geometry and representation theory is to describe the cohomology of line bundles on flag varieties over a field of characteristic p. When p=0, the solution is given by the celebrated…
In the setting of modern mathematical logic and model theory, classification theory has been one of the landmark achievements of the field. Likewise, the classification of UHF-algebras and AF-algebras were substantial contributions to the…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…
The computational method of parametric probability analysis is introduced. It is demonstrated how to embed logical formulas from the propositional calculus into parametric probability networks, thereby enabling sound reasoning about the…
Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…
There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy…