In this work we study the existence of nontrivial solution for the following class of semilinear degenerate elliptic equations

\[ -\Delta_{\gamma} u + a(z)u = f(u) \quad \mbox{in}\ \mathbb{R}^{N}, \]

$\Delta _{\gamma }$

$z:=(x,y)\in \mathbb {R}^{m}\times \mathbb {R}^{k}$

$m+k=N\geqslant 3$

$f$

$a$

$a=1$

The clustered chromatic number of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We determine the clustered chromatic number of any minor-closed class with bounded treedepth, and prove a best possible upper bound on the clustered chromatic number of any minor-closed class with bounded pathwidth. As a consequence, we determine the fractional clustered chromatic number of every minor-closed class.

For a state $\omega$ on a C$^{*}$-algebra $A$, we characterize all states $\rho$ in the weak* closure of the set of all states of the form $\omega \circ \varphi$, where $\varphi$ is a map on $A$ of the form $\varphi (x)=\sum \nolimits _{i=1}^{n}a_i^{*}xa_i,$ $\sum \nolimits _{i=1}^{n}a_i^{*}a_i=1$ ($a_i\in A$, $n\in \mathbb {N}$). These are precisely the states $\rho$ that satisfy $\|\rho |J\|\leq \|\omega |J\|$ for each ideal $J$ of $A$. The corresponding question for normal states on a von Neumann algebra $\mathcal {R}$ (with the weak* closure replaced by the norm closure) is also considered. All normal states of the form $\omega \circ \psi$, where $\psi$ is a quantum channel on $\mathcal {R}$ (that is, a map of the form $\psi (x)=\sum \nolimits _ja_j^{*}xa_j$, where $a_j\in \mathcal {R}$ are such that the sum $\sum \nolimits _ja_j^{*}a_j$ converge to $1$ in the weak operator topology) are characterized. A variant of this topic for hermitian functionals instead of states is investigated. Maximally mixed states are shown to vanish on the strong radical of a C$^{*}$-algebra and for properly infinite von Neumann algebras the converse also holds.

We study the problem of finding pairwise vertex-disjoint triangles in the randomly perturbed graph model, which is the union of any $n$-vertex graph $G$ satisfying a given minimum degree condition and the binomial random graph $G(n,p)$. We prove that asymptotically almost surely $G \cup G(n,p)$ contains at least $\min \{\delta (G), \lfloor n/3 \rfloor \}$ pairwise vertex-disjoint triangles, provided $p \ge C \log n/n$, where $C$ is a large enough constant. This is a perturbed version of an old result of Dirac.

Our result is asymptotically optimal and answers a question of Han, Morris, and Treglown [RSA, 2021, no. 3, 480–516] in a strong form. We also prove a stability version of our result, which in the case of pairwise vertex-disjoint triangles extends a result of Han, Morris, and Treglown [RSA, 2021, no. 3, 480–516]. Together with a result of Balogh, Treglown, and Wagner [CPC, 2019, no. 2, 159–176], this fully resolves the existence of triangle factors in randomly perturbed graphs.

We believe that the methods introduced in this paper are useful for a variety of related problems: we discuss possible generalisations to clique factors, cycle factors, and $2$-universality.

Let $\pi \colon \mathcal {X}\to B$ be a family whose general fibre $X_b$ is a $(d_1,\,\ldots,\,d_a)$-polarization on a general abelian variety, where $1\leq d_i\leq 2$, $i=1,\,\ldots,\,a$ and $a\geq 4$. We show that the fibres are in the same birational class if all the $(m,\,0)$-forms on $X_b$ are liftable to $(m,\,0)$-forms on $\mathcal {X}$, where $m=1$ and $m=a-1$. Actually, we show a general criteria to establish whether the fibres of certain families belong to the same birational class.

We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields of arbitrary characteristic. Furthermore, from the same perspective, we study a family of cluster algebras which are not of finite type and which arise from a star shaped quiver.

A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is not allowed to revisit a node in one step. Second-order random walks can model physical diffusion phenomena in a more realistic way than traditional random walks and have been very successfully used in various network mining and machine learning settings. However, numerous questions are still open for this type of stochastic processes. In this work, we extend well-known results concerning mean hitting and return times of standard random walks to the second-order case. In particular, we provide simple formulas that allow us to compute these numbers by solving suitable systems of linear equations. Moreover, by introducing the ‘pullback’ first-order stochastic process of a second-order random walk, we provide second-order versions of the renowned Kac’s and Random Target Lemmas.

We show that the theory of Galois actions of a torsion Abelian group A is companionable if and only if, for each prime p, the p-primary part of A is either finite or it coincides with the Prüfer p-group. We also provide a model-theoretic description of the model companions we obtain.