In this article, we investigate the $L^2$-Dolbeault cohomology of the symmetric power of cotangent bundles of ball quotients with finite volume, as well as their toroidal compactification. Moreover, by proving the finite dimensionality of these cohomologies, through the application of Hodge theory for complete Hermitian manifolds, we establish the existence of Hodge decomposition and Green’s operator.

Goldstern showed in [7] that the union of a real-parametrized, monotone family of Lebesgue measure zero sets has also Lebesgue measure zero, provided that the sets are uniformly $\boldsymbol {\Sigma }^1_1$. Our aim is to study to what extent we can drop the $\boldsymbol {\Sigma }^1_1$ assumption. We show that Goldstern’s principle for the pointclass $\boldsymbol {\Pi }^1_1$ holds. We show that Goldstern’s principle for the pointclass of all subsets is consistent with $\mathsf {ZFC}$ and show its negation follows from $\mathsf {CH}$. Also we prove that Goldstern’s principle for the pointclass of all subsets holds both under $\mathsf {ZF} + \mathsf {AD}$ and in Solovay models.

In this article we study the theories of the infinite-branching tree and the r-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of graphs, and provide a characterization of the Morley rank of definable sets in terms of the degrees of polynomials measuring their non-standard cardinalities. This answers negatively some questions from [2], where it is asked whether every stable generalised measurable structure is one-based.

We give a presentation of the torus-equivariant (small) quantum K-ring of flag manifolds of type C as an explicit quotient of a Laurent polynomial ring; our presentation can be thought of as a quantization of the classical Borel presentation of the ordinary K-ring of flag manifolds. Also, we give an explicit Laurent polynomial representative for each special Schubert class in our Borel-type presentation of the quantum K-ring.

In this paper, we are concerned with the following Dirichlet problems for nonlinear equations involving the fractional $p$-Laplacian:

\begin{equation*}\begin{cases}(-\Delta)_p^\alpha u=f(x,u,\nabla u),\ \ u \gt 0,\ \ \text{in}\ \ E,\\\ \ \ \ \ \ u\equiv0, \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \text{in}\ \ \mathbb{R}^{n}\setminus E,\end{cases}\end{equation*}

where $E \subseteq \mathbb{R}^{n}$ is a coercive epigraph, i.e., there exists a continuous function $\phi: \, \mathbb{R}^{n-1} \rightarrow \mathbb{R}$ satisfying

\begin{equation*}\lim_{|x'|\rightarrow+\infty}\phi(x')=+\infty,\end{equation*}

such that $E:=\{x=(x',x_{n}) \in \mathbb{R}^{n}|\,x_{n} \gt \phi(x')\}$, where $x':= (x_{1},...,x_{n-1}) \in \mathbb{R}^{n-1}$. Under some mild assumptions on the nonlinearity $f(x,u,\nabla u)$, we prove strict monotonicity of positive solutions to the above Dirichlet problems involving fractional $p$-Laplacian in coercive epigraph $E$.

We show that for any integer $k\ge 1$ there exists an integer $t_0(k)$ such that, for integers $t, k_1, \ldots , k_{t+1}, n$ with $t\gt t_0(k)$, $\max \{k_1, \ldots , k_{t+1}\}\le k$, and $n \gt 2k(t+1)$, the following holds: If $F_i$ is a $k_i$-uniform hypergraph with vertex set $[n]$ and more than $ \binom{n}{k_i}-\binom{n-t}{k_i} - \binom{n-t-k}{k_i-1} + 1$ edges for all $i \in [t+1]$, then either $\{F_1,\ldots , F_{t+1}\}$ admits a rainbow matching of size $t+1$ or there exists $W\in \binom{[n]}{t}$ such that $W$ intersects $F_i$ for all $i\in [t+1]$. This may be viewed as a rainbow non-uniform extension of the classical Hilton-Milner theorem. We also show that the same holds for every $t$ and $n \gt 2k^3t$, generalizing a recent stability result of Frankl and Kupavskii on matchings to rainbow matchings.

For each of the four particle processes given by Dieker and Warren, we show the n-step transition kernels are given by the (dual) (weak) refined symmetric Grothendieck functions up to a simple overall factor. We do so by encoding the particle dynamics as the basis of free fermions first introduced by the first author, which we translate into deformed Schur operators acting on partitions. We provide a direct combinatorial proof of this relationship in each case, where the defining tableaux naturally describe the particle motions.

A classical theorem of Jordan asserts that if a group G acts transitively on a finite set of size at least $2$, then G contains a derangement (a fixed-point free element). Generalisations of Jordan’s theorem have been studied extensively, due in part to their applications in graph theory, number theory and topology. We address a generalisation conjectured recently by Ellis and Harper [‘Orbits of permutation groups with no derangements’, Preprint, 2024, arXiv:2408.16064], which says that if G has exactly two orbits and those orbits have equal length $n \geq 2$, then G contains a derangement. We prove this conjecture in the case where n is a product of two primes, and in the case where $n=bp$ with p a prime and $2b\leq p$. We also verify the conjecture computationally for $n \leq 30$.

Inequality is an inherent quality of society. This paper provides actuarial insights into the recognition, measurement, and consequences of inequality. Key underlying concepts are discussed, with an emphasis on the distinction between inequality of opportunity and inequality of outcome. To better design and maintain approaches and programmes that mitigate its adverse effects, it is important to understand its contributing causes. The paper outlines strategies for reflecting on and addressing inequality in actuarial practice. Actuaries are encouraged to work with policymakers, employers, providers, regulators, and individuals in the design and management of sustainable programmes to address some of the critical issues associated with inequality. These programmes can encourage more equal opportunities and protect against the adverse financial effects of outcomes.

It is a well-known empirical phenomenon that natural axiomatic theories are pre-well-ordered by consistency strength. Without a precise mathematical definition of “natural,” it is unclear how to study this phenomenon mathematically. We will discuss the significance of this problem and survey some strategies that have recently been developed for addressing it. These strategies emphasize the role of reflection principles and ordinal analysis and draw on analogies with research in recursion theory.

Negative dependence in tournaments has received attention in the literature. The property of negative orthant dependence (NOD) was proved for different tournament models with a special proof for each model. For general round-robin tournaments and knockout tournaments with random draws, Malinovsky and Rinott (2023) unified and simplified many existing results in the literature by proving a stronger property, negative association (NA). For a knockout tournament with a non-random draw, they presented an example to illustrate that ${\boldsymbol{S}}$ is NOD but not NA. However, their proof is not correct. In this paper, we establish the properties of negative regression dependence (NRD), negative left-tail dependence (NLTD), and negative right-tail dependence (NRTD) for a knockout tournament with a random draw and with players being of equal strength. For a knockout tournament with a non-random draw and with equal strength, we prove that ${\boldsymbol{S}}$ is NA and NRTD, while ${\boldsymbol{S}}$ is, in general, not NRD or NLTD.

In this paper, we investigate a competitive market involving two agents who consider both their own wealth and the wealth gap with their opponent. Both agents can invest in a financial market consisting of a risk-free asset and a risky asset, under conditions where model parameters are partially or completely unknown. This setup gives rise to a nonzero-sum differential game within the framework of reinforcement learning (RL). Each agent aims to maximize his own Choquet-regularized, time-inconsistent mean-variance objective. Adopting the dynamic programming approach, we derive a time-consistent Nash equilibrium strategy in a general incomplete market setting. Under the additional assumption of a Gaussian mean return model, we obtain an explicit analytical solution, which facilitates the development of a practical RL algorithm. Notably, the proposed algorithm achieves uniform convergence, even though the conventional policy improvement theorem does not apply to the equilibrium policy. Numerical experiments demonstrate the robustness and effectiveness of the algorithm, underscoring its potential for practical implementation.

In this paper, we establish the $L^p$ bounds for partial polynomial Carleson operators along polynomial curves for $p \gt 1$, which depend only on $p$ and the number of monomials in the defining polynomial. Additionally, we study two classes of oscillatory integral operators of Radon type and derive uniform $L^2$ bounds.

We extend a classical model of continuous opinion formation to explicitly include an age-structured population. We begin by considering a stochastic differential equation model which incorporates ageing dynamics and birth/death processes, in a bounded confidence type opinion formation model. We then derive and analyse the corresponding mean field partial differential equation and compare the complex dynamics on the microscopic and macroscopic levels using numerical simulations. We rigorously prove the existence of stationary states in the mean field model, but also demonstrate that these stationary states are not necessarily unique. Finally, we establish connections between this and other existing models in various scenarios.

Given $\beta>1$, let $T_\beta $ be the $\beta $-transformation on the unit circle $[0,1)$, defined by $T_\beta (x)=\beta x-\lfloor \beta x\rfloor $. For each $t\in [0,1)$, let $K_\beta (t)$ be the survivor set consisting of all $x\in [0,1)$ whose orbit $\{T^n_\beta (x): n\ge 0\}$ never enters the interval $[0,t)$. Kalle et al [Ergod. Th. & Dynam. Sys. 40(9) (2020), 2482–2514] considered the case $\beta \in (1,2]$. They studied the set-valued bifurcation set $\mathscr {E}_\beta :=\{t\in [0,1): K_\beta (t')\ne K_\beta (t)~\text { for all } t'>t\}$ and proved that the Hausdorff dimension function $t\mapsto \dim _H K_\beta (t)$ is a non-increasing Devil’s staircase. In a previous paper [Ergod. Th. & Dynam. Sys. 43(6) (2023), 1785–1828], we determined, for all $\beta \in (1,2]$, the critical value $\tau (\beta ):=\min \{t>0: \eta _\beta (t)=0\}$. The purpose of the present article is to extend these results to all $\beta>1$. In addition to calculating $\tau (\beta )$, we show that: (i) the function $\tau : \beta \mapsto \tau (\beta )$ is left-continuous on $(1,\infty )$ with right-hand limits everywhere, but has countably infinitely many discontinuities; (ii) $\tau $ has no downward jumps; and (iii) there exists an open set $O\subset (1,\infty )$, whose complement $(1,\infty )\setminus O$ has zero Hausdorff dimension, such that $\tau $ is real-analytic, strictly convex, and strictly decreasing on each connected component of O. We also prove several topological properties of the bifurcation set $\mathscr {E}_\beta $. The key to extending the results from $\beta \in (1,2]$ to all $\beta>1$ is an appropriate generalization of the Farey words that are used to parameterize the connected components of the set O. Some of the original proofs from the above-mentioned papers are simplified.

Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H}$ and the conflicts to be avoided, a conflict-free almost-perfect matching can be extended to one covering all vertices in a particular subset of $ V(\mathcal{H})$, by using an additional set of edges; in particular, we ensure that our matching avoids all additional conflicts, which may consist of both old and new edges. This setup is useful for various applications in design theory and Ramsey theory. For example, our main result provides a crucial tool in the recent proof of the high-girth existence conjecture due to Delcourt and Postle. It also provides a black box which encapsulates many long and tedious calculations, greatly simplifying the proofs of results in generalised Ramsey theory.

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $ \mathcal R_{\mathbf Z}(h,k) = \{|hA|:A \subseteq \mathbf Z \text { and } |A|=k\}$ for all integers $h \geq 3$ and $k \geq 3$. This article constructs certain infinite families of finite sets of size k, computes their h-fold sumset sizes, and obtains explicit finite arithmetic progressions of sumset sizes in $ \mathcal R_{\mathbf Z}(h,k)$.