Related papers: On the Frankl's union-closed conjecture

In this paper, we prove the FPP conjecture, giving a strong upper bound on the unitary dual of a real reductive group. Our proof is an application of the global generation properties of $\mathcal{D}$-modules on the flag variety and their…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Much recent work on the iterates of a transcendental entire function $f$ has been motivated by Eremenko's conjecture that all the components of the escaping set $I(f)$ are unbounded. Here we show that if $I(f)$ is disconnected, then the set…

Let $G$ be a finite group, $H$ be a normal subgroup of prime index $p$. Let $F$ be a field of either characteristic $0$ or prime to $|G|$. Let $\eta$ be an irreducible $F$-representation of $H$. If $F$ is an algebraically closed field of…

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. For any positive integers $n$ and $k$, let $\binom{[n]}{k}$ denote…

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

In [Frobenius1896] it was shown that many important properties of a finite group could be examined using formulas involving the character ratios of group elements, i.e., the trace of the element acting in a given irreducible representation,…

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

We demonstrate the truth of the sunflower conjecture by showing that a family $\mathcal{F}$ of sets each of cardinality at most $m$ includes a $k$-sunflower, if $|\mathcal{F}| > ( c k )^{2m}$ for a constant $c>0$ independent of $m$ and $k$,…

Generalizing a result of Furstenberg, we show that for every infinite discrete group $G$, the Bernoulli flow $2^G$ is disjoint from every minimal $G$-flow. From this, we deduce that the algebra generated by the minimal functions…

We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…

We prove that irreducible complex representations of finitely generated nilpotent groups are monomial if and only if they have finite weight, which was conjectured by Parshin. Note that we consider (possibly, infinite-dimensional)…

In this paper we show that it is relatively consistent with ZFC that every gamma-set is countable while not every strong measure zero set is countable. This answers a question of Paul Szeptycki. A set is a gamma-set iff every omega-cover…

A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…

Assuming a lower bound on the dimension, we prove a long standing conjecture concerning the classification of global solutions of the obstacle problem with unbounded coincidence sets.

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…