Related papers: Classification theorem for strong triangle blockin…

Approximation theorems for algebraic stacks over a number field $k$ are studied in this article. For G a connected linear algebraic group over a number field we prove strong approximation with Brauer-Manin obstruction for the classifying…

Central configurations play an important role in the dynamics of the $n$-body problem: they occur as relative equilibria and as asymptotic configurations in colliding trajectories. We illustrate how they can be found as projective fixed…

We study closed, connected, spin 4-manifolds up to stabilisation by connected sums with copies of $S^2 \times S^2$. For a fixed fundamental group, there are primary, secondary and tertiary obstructions, which together with the signature…

We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

We introduce the notion of a strong L-space, a closed, oriented rational homology 3-sphere whose Heegaard Floer homology can be determined at the chain level. We prove that the fundamental group of a strong L-space is not left-orderable.…

A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…

We study conformal blocks of conformal field theories with a W3 symmetry algebra in the limit where the central charge is large. In this limit, we compute the four-point block as a special case of an sl3-invariant function. In the case when…

The block structure of double saddle-point problems has prompted extensive research into efficient preconditioners. This paper introduces a novel class of three-by-three block preconditioners tailored for such systems from the…

Simonovits and S\'{o}s conjectured that the maximal size of a triangle-intersecting family of graphs on $n$ vertices is $2^{\binom{n}{2}-3}$. Their conjecture has recently been proved using spectral methods. We provide an elementary proof…

AND-OR networks are Boolean networks where each coordinate function is either the AND or OR logical operator. We study the number of fixed points of these Boolean networks in the case that they have a wiring diagram with chain topology. We…

We consider the problem of embedding a symmetric configuration with block size 3 in an orientable surface in such a way that the blocks of the configuration form triangular faces and there is only one extra large face. We develop a…

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

The main purpose of this paper is to obtain strong laws of large numbers for arrays or weighted sums of random variables under a scenario of dependence. Namely, for triangular arrays $\{X_{n,k}, \, 1 \leqslant k \leqslant n, \, n \geqslant…

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines. We…

Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency…

In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Using the example of the two-dimensional (2D) Ising model, we show that in contrast to what can be done in configuration space, the tensor renormalization group (TRG) formulation allows one to write exact, compact, and manifestly local…