More Like this

1. Large monochromatic components in expansive hypergraphs

   https://doi.org/10.1017/S096354832400004X  

   Bal, Deepak; DeBiasio, Louis (March 2024, Combinatorics, Probability and Computing)

   Abstract A result of Gyárfás [12] exactly determines the size of a largest monochromatic component in an arbitrary$$r$$-colouring of the complete$$k$$-uniform hypergraph$$K_n^k$$when$$k\geq 2$$and$$k\in \{r-1,r\}$$. We prove a result which says that if one replaces$$K_n^k$$in Gyárfás’ theorem by any ‘expansive’$$k$$-uniform hypergraph on$$n$$vertices (that is, a$$k$$-uniform hypergraph$$G$$on$$n$$vertices in which$$e(V_1, \ldots, V_k)\gt 0$$for all disjoint sets$$V_1, \ldots, V_k\subseteq V(G)$$with$$|V_i|\gt \alpha$$for all$$i\in [k]$$), then one gets a largest monochromatic component of essentially the same size (within a small error term depending on$$r$$and$$\alpha$$). As corollaries we recover a number of known results about large monochromatic components in random hypergraphs and random Steiner triple systems, often with drastically improved bounds on the error terms. Gyárfás’ result is equivalent to the dual problem of determining the smallest possible maximum degree of an arbitrary$$r$$-partite$$r$$-uniform hypergraph$$H$$with$$n$$edges in which every set of$$k$$edges has a common intersection. In this language, our result says that if one replaces the condition that every set of$$k$$edges has a common intersection with the condition that for every collection of$$k$$disjoint sets$$E_1, \ldots, E_k\subseteq E(H)$$with$$|E_i|\gt \alpha$$, there exists$$(e_1, \ldots, e_k)\in E_1\times \cdots \times E_k$$such that$$e_1\cap \cdots \cap e_k\neq \emptyset$$, then the smallest possible maximum degree of$$H$$is essentially the same (within a small error term depending on$$r$$and$$\alpha$$). We prove our results in this dual setting. 

   more » « less
2. Paucity problems and some relatives of Vinogradov’s mean value theorem

   https://doi.org/10.1017/S0305004123000166  

   WOOLEY, TREVOR D. (September 2023, Mathematical Proceedings of the Cambridge Philosophical Society)

   Abstract When$$k\geqslant 4$$and$$0\leqslant d\leqslant (k-2)/4$$, we consider the system of Diophantine equations\begin{align*}x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\leqslant j\leqslant k,\, j\ne k-d).\end{align*}We show that in this cousin of a Vinogradov system, there is a paucity of non-diagonal positive integral solutions. Our quantitative estimates are particularly sharp when$$d=o\!\left(k^{1/4}\right)$$. 

   more » « less
3. IWASAWA THEORY FOR p -TORSION CLASS GROUP SCHEMES IN CHARACTERISTIC p

   https://doi.org/10.1017/nmj.2022.30  

   BOOHER, JEREMY; CAIS, BRYDEN (June 2023, Nagoya Mathematical Journal)

   Abstract We investigate a novel geometric Iwasawa theory for$${\mathbf Z}_p$$-extensions of function fields over a perfect fieldkof characteristic$$p>0$$by replacing the usual study ofp-torsion in class groups with the study ofp-torsion class groupschemes. That is, if$$\cdots \to X_2 \to X_1 \to X_0$$is the tower of curves overkassociated with a$${\mathbf Z}_p$$-extension of function fields totally ramified over a finite nonempty set of places, we investigate the growth of thep-torsion group scheme in the Jacobian of$$X_n$$as$$n\rightarrow \infty $$. By Dieudonné theory, this amounts to studying the first de Rham cohomology groups of$$X_n$$equipped with natural actions of Frobenius and of the Cartier operatorV. We formulate and test a number of conjectures which predict striking regularity in the$$k[V]$$-module structure of the space$$M_n:=H^0(X_n, \Omega ^1_{X_n/k})$$of global regular differential forms as$$n\rightarrow \infty .$$For example, for each tower in a basic class of$${\mathbf Z}_p$$-towers, we conjecture that the dimension of the kernel of$$V^r$$on$$M_n$$is given by$$a_r p^{2n} + \lambda _r n + c_r(n)$$for allnsufficiently large, where$$a_r, \lambda _r$$are rational constants and$$c_r : {\mathbf Z}/m_r {\mathbf Z} \to {\mathbf Q}$$is a periodic function, depending onrand the tower. To provide evidence for these conjectures, we collect extensive experimental data based on new and more efficient algorithms for working with differentials on$${\mathbf Z}_p$$-towers of curves, and we prove our conjectures in the case$$p=2$$and$$r=1$$. 

   more » « less
4. Multi-linear forms, graphs, and $L^p$-improving measures in $${\Bbb F}_q^d$$

   https://doi.org/10.4153/S0008414X2300086X  

   Bhowmik, Pablo; Iosevich, Alex; Koh, Doowon; Pham, Thang (February 2025, Canadian journal of mathematics)

   Abstract The purpose of this paper is to introduce and study the following graph-theoretic paradigm. Let$$ \begin{align*}T_Kf(x)=\int K(x,y) f(y) d\mu(y),\end{align*} $$where$$f: X \to {\Bbb R}$$,Xa set, finite or infinite, andKand$$\mu $$denote a suitable kernel and a measure, respectively. Given a connected ordered graphGonnvertices, consider the multi-linear form$$ \begin{align*}\Lambda_G(f_1,f_2, \dots, f_n)=\int_{x^1, \dots, x^n \in X} \ \prod_{(i,j) \in {\mathcal E}(G)} K(x^i,x^j) \prod_{l=1}^n f_l(x^l) d\mu(x^l),\end{align*} $$where$${\mathcal E}(G)$$is the edge set ofG. Define$$\Lambda _G(p_1, \ldots , p_n)$$as the smallest constant$$C>0$$such that the inequality(0.1)$$ \begin{align} \Lambda_G(f_1, \dots, f_n) \leq C \prod_{i=1}^n {||f_i||}_{L^{p_i}(X, \mu)} \end{align} $$holds for all nonnegative real-valued functions$$f_i$$,$$1\le i\le n$$, onX. The basic question is, how does the structure ofGand the mapping properties of the operator$$T_K$$influence the sharp exponents in (0.1). In this paper, this question is investigated mainly in the case$$X={\Bbb F}_q^d$$, thed-dimensional vector space over the field withqelements,$$K(x^i,x^j)$$is the indicator function of the sphere evaluated at$$x^i-x^j$$, and connected graphsGwith at most four vertices. 

   more » « less
5. New lower bounds for matrix multiplication and

   https://doi.org/10.1017/fmp.2023.14  

   Conner, Austin; Harper, Alicia; Landsberg, J.M. (January 2023, Forum of Mathematics, Pi)

   Abstract Let$$M_{\langle \mathbf {u},\mathbf {v},\mathbf {w}\rangle }\in \mathbb C^{\mathbf {u}\mathbf {v}}{\mathord { \otimes } } \mathbb C^{\mathbf {v}\mathbf {w}}{\mathord { \otimes } } \mathbb C^{\mathbf {w}\mathbf {u}}$$denote the matrix multiplication tensor (and write$$M_{\langle \mathbf {n} \rangle }=M_{\langle \mathbf {n},\mathbf {n},\mathbf {n}\rangle }$$), and let$$\operatorname {det}_3\in (\mathbb C^9)^{{\mathord { \otimes } } 3}$$denote the determinant polynomial considered as a tensor. For a tensorT, let$$\underline {\mathbf {R}}(T)$$denote its border rank. We (i) give the first hand-checkable algebraic proof that$$\underline {\mathbf {R}}(M_{\langle 2\rangle })=7$$, (ii) prove$$\underline {\mathbf {R}}(M_{\langle 223\rangle })=10$$and$$\underline {\mathbf {R}}(M_{\langle 233\rangle })=14$$, where previously the only nontrivial matrix multiplication tensor whose border rank had been determined was$$M_{\langle 2\rangle }$$, (iii) prove$$\underline {\mathbf {R}}( M_{\langle 3\rangle })\geq 17$$, (iv) prove$$\underline {\mathbf {R}}(\operatorname {det}_3)=17$$, improving the previous lower bound of$$12$$, (v) prove$$\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.32\mathbf {n}$$for all$$\mathbf {n}\geq 25$$, where previously only$$\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1$$was known, as well as lower bounds for$$4\leq \mathbf {n}\leq 25$$, and (vi) prove$$\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.6\mathbf {n}$$for all$$\mathbf {n} \ge 18$$, where previously only$$\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+2$$was known. The last two results are significant for two reasons: (i) they are essentially the first nontrivial lower bounds for tensors in an “unbalanced” ambient space and (ii) they demonstrate that the methods we use (border apolarity) may be applied to sequences of tensors. The methods used to obtain the results are new and “nonnatural” in the sense of Razborov and Rudich, in that the results are obtained via an algorithm that cannot be effectively applied to generic tensors. We utilize a new technique, calledborder apolaritydeveloped by Buczyńska and Buczyński in the general context of toric varieties. We apply this technique to develop an algorithm that, given a tensorTand an integerr, in a finite number of steps, either outputs that there is no border rankrdecomposition forTor produces a list of all normalized ideals which could potentially result from a border rank decomposition. The algorithm is effectively implementable whenThas a large symmetry group, in which case it outputs potential decompositions in a natural normal form. The algorithm is based on algebraic geometry and representation theory. 

   more » « less