Related papers: Flag Algebras: A First Glance
Following the program of algebraic Frobenius splitting begun by Kumar and Littelmann, we use representation-theoretic techniques to construct a Frobenius splitting of the cotangent bundle of the flag variety of a semisimple algebraic group…
We develop an algebraic version of Cartan method of equivalence or an analog of Tanaka prolongation for the (extrinsic) geometry of curves of flags of a vector space $W$ with respect to the action of a subgroup $G$ of the $GL(W)$. Under…
These are extended notes for a series of lectures on Hall algebras given at the CRM Barcelona in February 2015. The basic idea of the theory of Hall algebras is that the collection of flags in an exact category encodes an associative…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…
For a semi-simple simply connected algebraic group G we introduce certain parabolic analogues of the Nekrasov partition function (introduced by Nekrasov and studied recently by Nekrasov-Okounkov and Nakajima-Yoshioka for G=SL(n)). These…
We develop a theory of diophantine approximation on generalized flag varieties, varieties that can be obtained as a quotient of a semisimple algebraic group by a parabolic subgroup. Using methods from the theory of arithmetic groups, due in…
One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…
The shape and orientation of data clouds reflect variability in observations that can confound pattern recognition systems. Subspace methods, utilizing Grassmann manifolds, have been a great aid in dealing with such variability. However,…
We find a new definition of colored edge graphs of finite algebras in the case of minimal Taylor algebras, a definition which includes the graphs invented by A. Bulatov. Next we proceed to reprove the main results of A. Bulatov's theory in…
We first discuss the problems in the theory of ordinary differential equations that gave rise to the concept of a flag system and illustrate these with the Cartan criterion for Monge equations (1st order) as well as the Cartan statement…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum…
The abstract chromatic number was introduced by Razborov and Coregliano in 2020 in using the language of model theory, and was used to extend the Erd\H os-Stone-Simonovits theorem to graphs with extra structures. A purely combinatorial…
Each flag manifold carries a unique algebra of chiral differential operators. Continuing along the lines of arXiv:0903.1281 we compute the vertex algebra structure on the cohomology of this algebra. The answer is: the tensor product of the…
Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…
Building upon the application of flags to network coding introduced by Liebhold, Nebe, and Vazquez-Castro, we develop a variant of this coding technique that uses degenerate flags. The information set is a metric affine space isometric to…
We compute the topological Witt groups of every complex flag manifold of ordinary type, and thus the interesting (i.e. torsion) part of the KO-groups of these manifolds. Equivalently, we compute Balmer's Witt groups of each flag variety of…
We present a general method for constructing real solutions to some problems in enumerative geometry which gives lower bounds on the maximum number of real solutions. We apply this method to show that two new classes of enumerative…
In this expository note we present a proof of the V.A. Vassiliev conjecture on the planarity of graphs with vertices of degree 4 and certain additional structure. Both statement and proof are accessible to high-school students familiar with…