arXiv subjects

Blanca Radillo-Murguia

Publications and source records attributed to Blanca Radillo-Murguia.

4 recordsLinked to original sources

arXiv2026

Covering lemmas associated to maximal operators of weak type

Building on the work of A. Córdoba and R. Fefferman, we provide a necessary and sufficient covering condition on a basis $\mathcal{B}$ on a separable metric space $X$ with a Borel measure $μ$ so that the associated \mbox{geometric} maximal operator $M_\mathcal{B}$ satisfies for all $α> 0$ the weak type estimate $$μ\left(\left\{x \in X : M_\mathcal{B}f(x) > α\right\}\right) \leq \int_{X}Φ\left( γ_\mathcal{B} \left|\frac{f}α\right|\right)\,dμ\;,$$ where $Φ: [0, \infty) \rightarrow [0, \infty)$ is an everywhere finite Young's function.

math.CA↗

arXiv2025

Probabilistic Construction of Kakeya-Type Sets in $\mathbb{R}^2$ associated to separated sets of directions

We provide a condition on a set of directions $Ω\subset \mathbb{S}^1$ ensuring that the associated directional maximal operator $M_Ω$ is unbounded on $L^p(\mathbb{R}^2)$ for every $1 \leq p < \infty$. The techniques of proof extend ideas of Bateman and Katz involving probabilistic construction of Kakeya-type sets involving sticky maps and Bernoulli percolation.

math.CA↗

arXiv2025

Remarks on the construction of $K_σ$ sets associated to trees not satisfying a separation condition

$K_σ$ sets involving sticky maps $σ$ have been used in the theory of differentiation of integrals to probabilistically construct Kakeya-type sets that imply certain types of directional maximal operators are unbounded on $L^p(\mathbb{R}^2)$ for all $1 \leq p < \infty$. We indicate limits to this approach by showing that, given $ε> 0$ and a natural number $N$, there exists a tree $\mathcal{T}_{N, ε}$ of finite height that is lacunary of order $N$ but such that, for \emph{every} sticky map $σ: \mathcal{B}^{h(\mathcal{T}_{N, ε})} \rightarrow \mathcal{T}_{N, ε}$, one has $|K_σ \cap ((1,2) \times \mathbb{R})| \geq 1 - ε$.

math.CA↗

arXiv2022

Klein cordial trees and odd cyclic cordial friendship graphs

For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are as evenly distributed as possible. Much work has since been done with trees, hypertrees, paths, cycles, ladders, prisms, hypercubes, and bipartite graphs. In this paper we show that all trees are $\mathbb{Z}_2^2$-cordial except for $P_4$ and $P_5$. In addition, we give numerous results relating to $\mathbb{Z}_m$-cordiality of the friendship graph $F_n$. The most general result shows that when $m$ is an odd multiple of $3$, then $F_n$ is $\mathbb{Z}_m$-cordial for all $n$. We also give a general conjecture to determine when $F_n$ is $\mathbb{Z}_m$-cordial.

math.CO↗