More Like this

1. Block mapping class groups and their finiteness properties

   https://doi.org/10.1007/s10711-025-00985-9  

   Aramayona, J; Aroca, J; Cumplido, M; Skipper, R; Wu, X (April 2025, Geometriae Dedicata)

   Abstract Given$$g \in \mathbb N \cup \{0, \infty \}$$ $g\in N\cup \{0,\infty \}$, let$$\Sigma _g$$ ${\Sigma }_g$denote the closed surface of genusgwith a Cantor set removed, if$$g<\infty $$ $g<\infty$; or the blooming Cantor tree, when$$g= \infty $$ $g=\infty$. We construct a family$$\mathfrak B(H)$$ $B\left(H\right)$of subgroups of$${{\,\textrm{Map}\,}}(\Sigma _g)$$ $\text{Map}\left({\Sigma }_g\right)$whose elements preserve ablock decompositionof$$\Sigma _g$$ ${\Sigma }_g$, andeventually like actlike an element ofH, whereHis a prescribed subgroup of the mapping class group of the block. The group$$\mathfrak B(H)$$ $B\left(H\right)$surjects onto an appropriate symmetric Thompson group of Farley–Hughes; in particular, it answers positively. Our main result asserts that$$\mathfrak B(H)$$ $B\left(H\right)$is of type$$F_n$$ $F_n$if and only ifHis. As a consequence, for every$$g\in \mathbb N \cup \{0, \infty \}$$ $g\in N\cup \{0,\infty \}$and every$$n\ge 1$$ $n\ge 1$, we construct a subgroup$$G <{{\,\textrm{Map}\,}}(\Sigma _g)$$ $G<\text{Map}\left({\Sigma }_g\right)$that is of type$$F_n$$ $F_n$but not of type$$F_{n+1}$$ $F_{n+1}$, and which contains the mapping class group of every compact surface of genus$$\le g$$ $\le g$and with non-empty boundary. 

   more » « less
2. L-Systems and the Lovász Number

   https://doi.org/10.1007/s00493-025-00136-4  

   Linz, William (April 2025, Combinatorica)

   Abstract Given integers$$n> k > 0$$ $n>k>0$, and a set of integers$$L \subset [0, k-1]$$ $L\subset [0,k-1]$, anL-systemis a family of sets$$\mathcal {F}\subset \left( {\begin{array}{c}[n]\\ k\end{array}}\right) $$ $F\subset \left(\begin{array}{c}\left[n\right]\\ k\end{array}\right)$such that$$|F \cap F'| \in L$$ $|F\cap F^{\prime }|\in L$for distinct$$F, F'\in \mathcal {F}$$ $F,F^{\prime }\in F$.L-systems correspond to independent sets in a certain generalized Johnson graphG(n, k, L), so that the maximum size of anL-system is equivalent to finding the independence number of the graphG(n, k, L). TheLovász number$$\vartheta (G)$$ $\vartheta \left(G\right)$is a semidefinite programming approximation of the independence number$$\alpha $$ $\alpha$of a graphG. In this paper, we determine the leading order term of$$\vartheta (G(n, k, L))$$ $\vartheta \left(G\right(n,k,L\left)\right)$of any generalized Johnson graph withkandLfixed and$$n\rightarrow \infty $$ $n\to \infty$. As an application of this theorem, we give an explicit construction of a graphGonnvertices with a large gap between the Lovász number and the Shannon capacityc(G). Specifically, we prove that for any$$\epsilon > 0$$ $ϵ>0$, for infinitely manynthere is a generalized Johnson graphGonnvertices which has ratio$$\vartheta (G)/c(G) = \Omega (n^{1-\epsilon })$$ $\vartheta \left(G\right)/c\left(G\right)=\Omega \left(n^{1-ϵ}\right)$, which improves on all known constructions. The graphGa fortiorialso has ratio$$\vartheta (G)/\alpha (G) = \Omega (n^{1-\epsilon })$$ $\vartheta \left(G\right)/\alpha \left(G\right)=\Omega \left(n^{1-ϵ}\right)$, which greatly improves on the best known explicit construction. 

   more » « less
3. Probing light scalars and vector-like quarks at the high-luminosity LHC

   https://doi.org/10.1140/epjc/s10052-025-14085-1  

   Qureshi, U S; Gurrola, A; Flórez, A; Rodriguez, C (April 2025, The European Physical Journal C)

   Abstract A model based on a$$U(1)_{T^3_R}$$ $U{\left(1\right)}_{T_R^3}$extension of the Standard Model can address the mass hierarchy between generations of fermions, explain thermal dark matter abundance, and the muon$$g - 2$$ $g-2$,$$R_{(D)}$$ $R_{\left(D\right)}$, and$$R_{(D^*)}$$ $R_{\left(D^{\ast }\right)}$anomalies. The model contains a light scalar boson$$\phi '$$ ${\varphi }^{\prime }$and a heavy vector-like quark$$\chi _\textrm{u}$$ ${\chi }_{\text{u}}$that can be probed at CERN’s large hadron collider (LHC). We perform a phenomenology study on the production of$$\phi '$$ ${\varphi }^{\prime }$and$${\chi }_u$$ ${\chi }_u$particles from proton–proton$$(\textrm{pp})$$ $\left(\text{pp}\right)$collisions at the LHC at$$\sqrt{s}=13.6$$ $\sqrt{s}=13.6$TeV, primarily through$$g{-g}$$ $g-g$and$$t{-\chi _\textrm{u}}$$ $t-{\chi }_{\text{u}}$fusion. We work under a simplified model approach and directly take the$$\chi _\textrm{u}$$ ${\chi }_{\text{u}}$and$$\phi '$$ ${\varphi }^{\prime }$masses as free parameters. We perform a phenomenological analysis considering$$\chi _\textrm{u}$$ ${\chi }_{\text{u}}$final states to b-quarks, muons, and neutrinos, and$$\phi '$$ ${\varphi }^{\prime }$decays to$$\mu ^+\mu ^-$$ ${\mu }^{+}{\mu }^{-}$. A machine learning algorithm is used to maximize the signal sensitivity, considering an integrated luminosity of 3000$$\text {fb}^{-1}$$ ${\text{fb}}^{-1}$. The proposed methodology can be a key mode for discovery over a large mass range, including low masses, traditionally considered difficult due to experimental constraints. 

   more » « less
4. Equality Conditions for the Fractional Superadditive Volume Inequalities

   https://doi.org/10.1007/s00454-024-00672-8  

   Meyer, Mark (July 2025, Discrete & Computational Geometry)

   Abstract While studying set function properties of Lebesgue measure, F. Barthe and M. Madiman proved that Lebesgue measure is fractionally superadditive on compact sets in$$\mathbb {R}^n$$ $R^n$. In doing this they proved a fractional generalization of the Brunn–Minkowski–Lyusternik (BML) inequality in dimension$$n=1$$ $n=1$. In this paper we will prove the equality conditions for the fractional superadditive volume inequalites for any dimension. The non-trivial equality conditions are as follows. In the one-dimensional case we will show that for a fractional partition$$(\mathcal {G},\beta )$$ $(G,\beta )$and nonempty sets$$A_1,\dots ,A_m\subseteq \mathbb {R}$$ $A_1,\cdots ,A_m\subseteq R$, equality holds iff for each$$S\in \mathcal {G}$$ $S\in G$, the set$$\sum _{i\in S}A_i$$ ${\sum }_{i\in S}{A}_i$is an interval. In the case of dimension$$n\ge 2$$ $n\ge 2$we will show that equality can hold if and only if the set$$\sum _{i=1}^{m}A_i$$ ${\sum }_{i=1}^m{A}_i$has measure 0. 

   more » « less
5. Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile

   https://doi.org/10.1007/s00454-022-00426-4  

   Greenfeld, Rachel; Tao, Terence (January 2023, Discrete & Computational Geometry)

   Abstract We construct an example of a group$$G = \mathbb {Z}^2 \times G_0$$ $G=Z^2\times G_0$for a finite abelian group $$G_0$$ $G_0$, a subsetEof $$G_0$$ $G_0$, and two finite subsets$$F_1,F_2$$ $F_1,F_2$of G, such that it is undecidable in ZFC whether$$\mathbb {Z}^2\times E$$ $Z^2\times E$can be tiled by translations of$$F_1,F_2$$ $F_1,F_2$. In particular, this implies that this tiling problem isaperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings ofEby the tiles$$F_1,F_2$$ $F_1,F_2$, but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in $$\mathbb {Z}^2$$ $Z^2$). A similar construction also applies for$$G=\mathbb {Z}^d$$ $G=Z^d$for sufficiently large d. If one allows the group$$G_0$$ $G_0$to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile F. The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles. 

   more » « less