We prove that for a homogeneous linear partial differential operator $\mathcal {A}$ of order $k \le 2$ and an integrable map $f$ taking values in the essential range of that operator, there exists a function $u$ of special bounded variation satisfying

\[ \mathcal{A} u(x)= f(x) \qquad \text{almost everywhere}. \]

$\mathbf {R}^N$

$0 \le m < N$

$m$

$(m+1)$

Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton–Watson trees. For example, let $\mathcal{T}_1$ be the event that a Galton–Watson tree is infinite and let $\mathcal{T}_2$ be the event that it contains an infinite binary tree starting from its root. These events satisfy similar recursive properties: $\mathcal{T}_1$ holds if and only if $\mathcal{T}_1$ holds for at least one of the trees initiated by children of the root, and $\mathcal{T}_2$ holds if and only if $\mathcal{T}_2$ holds for at least two of these trees. The probability of $\mathcal{T}_1$ has a continuous phase transition, increasing from 0 when the mean of the child distribution increases above 1. On the other hand, the probability of $\mathcal{T}_2$ has a first-order phase transition, jumping discontinuously to a non-zero value at criticality. Given the recursive property satisfied by the event, we describe the critical child distributions where a continuous phase transition takes place. In many cases, we also characterise the event undergoing the phase transition.

It is proved that there is a formula $\pi \left( {h,x} \right)$ in the first-order language of group theory such that each component and each non-abelian minimal normal subgroup of a finite group G is definable by $\pi \left( {h,x} \right)$ for a suitable element h of G; in other words, each such subgroup has the form $\left\{ {x|x\pi \left( {h,x} \right)} \right\}$ for some h. A number of consequences for infinite models of the theory of finite groups are described.

The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first-order logic program with default negation. In a preliminary step, this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX. is presented as a first-order forward chaining approach for Answer Set Computing. This project was among the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process. The methodology applies a forward chaining of first-order rules that are grounded on the fly by means of previously produced atoms. Theoretical foundations of the approach are presented, the main algorithms of the ASP solver ASPeRiX. are detailed and some experiments and comparisons with existing systems are provided.