For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta _{\mathrm {sub}}(n, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$, we asymptotically determined the value of $\delta _{\mathrm {sub}}(n, H)$. More precisely, for every graph $H$ with at least one edge, there is an integer $\mathrm {hcf}_{\xi }(H)$ and a constant $1 \lt \xi ^*(H)\leq 2$ that can be explicitly determined by structural properties of $H$ such that $\delta _{\mathrm {sub}}(n, H) = \left (1 - \frac {1}{\xi ^*(H)} + o(1) \right )n$ holds for all $n$ and $H$ unless $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd. When $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd, then we show that $\delta _{\mathrm {sub}}(n, H) = \left (\frac {1}{2} + o(1) \right )n$.

We give a complete combinatorial classification of the parabolic Verma modules in the principal block of the parabolic category $\mathcal{O}$ associated with a minimal or a maximal parabolic subalgebra of the special linear Lie algebra for which the answer to Kostant’s problem is positive.

Recently it has been shown that the unique local perimeter minimizing partitioning of the plane into three regions, where one region has finite area and the other two have infinite measure, is given by the so-called standard lens partition. Here we prove a sharp stability inequality for the standard lens, hence strengthening the local minimality of the lens partition in a quantitative form. As an application of this stability result we consider a nonlocal perturbation of an isoperimetric problem.

Motivated by the study of algebraic classes in mixed characteristic, we define a countable subalgebra of ${\overline {\mathbb {Q}}}_p$ which we call the algebra of André’s p-adic periods. The classical Tannakian formalism cannot be used to study these new periods. Instead, inspired by ideas of Drinfel’d on the Plücker embedding and further developed by Haines, we produce an adapted Tannakian setting which allows us to bound the transcendence degree of André’s p-adic periods and to formulate the p-adic analog of the Grothendieck period conjecture. We exhibit several examples where special values of classical p-adic functions appear as André’s p-adic periods, and we relate these new conjectures to some classical problems on algebraic classes.

The notion of a strongly dense subgroup was introduced by Breuillard, Green, Guralnick and Tao: a subgroup Γ of a semi-simple $\mathbb{Q}$ algebraic group $\mathcal{G}$ is called strongly dense if every pair of non-commuting elements generate a Zariski dense subgroup. Amongst other things, Breuillard et al. prove that there exist strongly dense free subgroups in $\mathcal{G}({\mathbb{R}})$ and ask whether or not a Zariski dense subgroup of $\mathcal{G}(\mathbb{R})$ always contains a strongly dense free subgroup. In this paper, we answer this for many surface subgroups of $\textrm{SL}(3,\mathbb{R})$.

We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave, which emanates from a set of known nodes at an initial time, to all other unknown nodes at later times with an ordering determined by the arrival time of the information wave front. A second class of models is based on the notion of a travel time along paths between nodes. The time of information propagation from an initial known set of nodes to a node is defined as the minimum of a generalised travel time over subsets of all admissible paths. A final class is given by imposing a local equation of an eikonal form at each unknown node, with boundary conditions at the known nodes. The solution value of the local equation at a node is coupled to those of neighbouring nodes with lower values. We provide precise formulations of the model classes and prove equivalences between them. Finally, we apply the front propagation models on graphs to semi-supervised learning via label propagation and information propagation on trust networks.

Let (K, v) be a valued field and $\phi\in K[x]$ be any key polynomial for a residue-transcendental extension w of v to K(x). In this article, using the ϕ-Newton polygon of a polynomial $f\in K[x]$ (with respect to w), we give a lower bound for the degree of an irreducible factor of f. This generalizes the result given in Jakhar and Srinivas (On the irreducible factors of a polynomial II, J. Algebra 556 (2020), 649–655).

Let $G$ be a group. The notion of linear sofic approximations of $G$ over an arbitrary field $F$ was introduced and systematically studied by Arzhantseva and Păunescu [3]. Inspired by one of the results of [3], we introduce and study the invariant $\kappa _F(G)$ that captures the quality of linear sofic approximations of $G$ over $F$. In this work, we show that when $F$ has characteristic zero and $G$ is linear sofic over $F$, then $\kappa _F(G)$ takes values in the interval $[1/2,1]$ and $1/2$ cannot be replaced by any larger value. Further, we show that under the same conditions, $\kappa _F(G)=1$ when $G$ is torsion-free. These results answer a question posed by Arzhantseva and Păunescu [3] for fields of characteristic zero. One of the new ingredients of our proofs is an effective non-concentration estimates for random walks on finitely generated abelian groups, which may be of independent interest.

In this article, $\mathcal{F}_{S}(G)$ denotes the fusion category of G on a Sylow p-subgroup S of G where p denotes a prime. A subgroup K of G has normal complement in G if there is a normal subgroup T of G satisfying that G = KT and $T \cap K = 1$. We investigate the supersolvability of $\mathcal{F}_{S}(G)$ under the assumption that some subgroups of S are normal in G or have normal complement in G.