Related papers: The generic pair conjecture for dependent finite d…
We give bounds for the module sectional category of products of maps which generalise a theorem of Jessup for Lusternik-Schnirelmann category. We deduce also a proof of a Ganea type conjecture for topological complexity. This is a first…
We formulate and prove (in {\sf ZFC}) a strong coloring theorem which holds at successors of singular cardinals, and use it to answer several questions concerning Shelah's principle $Pr_1(\mu^+,\mu^+,\mu^+,\cf(\mu))$ for singular $\mu$.
This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first singular cardinal. These principles have found many other…
In the theory of generalized cluster algebras, we build the so-called cluster formula and $D$-matrix pattern. Then as applications, some fundamental conjectures of generalized cluster algebras are solved affirmatively.
We relate a generic character sheaf on a disconnected reductive group with a character of a representation of the rational points of the group over a finite field extending a result known in the connected case.
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We prove a conjecture of Casselman and Shahidi stating that the unique irreducible generic subquotient of a standard module is necessarily a subrepresentation for a large class of connected quasi-split reductive groups, in particular for…
K. Harada conjectured for any finite group $G$, the product of sizes of all conjugacy classes is divisible by the product of degrees of all irreducible characters. We study this conjecture when $G$ is the general linear group over a finite…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
We formulate a number of related generalisations of the weight part of Serre's conjecture to the case of GL(n) over an arbitrary number field, motivated by the formalism of the Breuil-M\'ezard conjecture. We give evidence for these…
Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…
In this paper, we show that general homogeneous manifolds $G/P$ satisfy Conjecture $\mathcal{O}$ of Galkin, Golyshev and Iritani which `underlies' Gamma conjectures I and II of them. Our main tools are the quantum Chevalley formula for…
We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…
In this note we clarify the relationship between the local and global definitions of dual pairs in Poisson geometry. It turns out that these are not equivalent. For the passage from local to global one needs a connected fiber hypothesis…
The paper is concerned with the existence of a universal graph at the successor of a strong limit singular mu of cofinality aleph_0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for…
It is conjectured by Godsil that the relative number of controllable graphs compared to the total number of simple graphs on n vertices approaches one as n tends to infinity. We prove that this conjecture is true. More generally, our…