Related papers: On scattered linear sets of pseudoregulus type in …
It is well known that the differences between the lepton numbers can be gauged with the Standard Model matter content. Such extended gauge theories, dubbed as the gauged U(1)$_{L_\alpha - L_\beta}$ models, have been widely discussed so far…
Two different Perfectly Matched Layer (PML) formulations with efficient pseudo-spectral numerical schemes are derived for the standard and non-relativistic nonlinear Klein-Gordon equations (NKGE). A pseudo-spectral explicit exponential…
We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…
The method of constrained randomisation is applied to three-dimensional simulated galaxy distributions. With this technique we generate for a given data set surrogate data sets which have the same linear properties as the original data…
Let $\mathrm{PG}(3, q)$ denote the three-dimensional projective space over the finite field with $q$ elements. A line-spread of $\mathrm{PG}(3, q)$ is a collection $\mathcal{S}$ of mutually skew lines such that every point of…
If $L$ is a semisimple Lie algebra of vector fields on R^N with a split Cartan subalgebra C, then it is proved that the dimension of the generic orbit of C coincides with the dimension of C. As a consequence one obtains a local canonical…
A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…
We describe a novel experimental technique for neutron imaging with scattered neutrons. These scattered neutrons are of interest for condensed matter physics, because they permit to reveal the local distribution of incoherent and coherent…
A generalized linear sigma model is employed to study the quark structure of low lying scalar as well as pseudoscalar states. The model allows the possible mixing of quark anti-quark states with others made of two quarks and two antiquarks…
We provide classification results for translation generalized quadrangles of order less or equal to $64$, and hence, for all incidence geometries related to them. The results consist of the classification of all pseudo-ovals in…
We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…
Correlated ${\cal G}$ distributions can be used to describe the clutter seen in images obtained with coherent illumination, as is the case of B-scan ultrasound, laser, sonar and synthetic aperture radar (SAR) imagery. These distributions…
This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…
We define the splash of a subgeometry on a projective line, extending the definition of \cite{BaJa13} to general dimension and prove that a splash is always a linear set. We also prove the converse: each linear set on a projective line is…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
It is shown that the two-part Minimum Description Length Principle can be used to discriminate among different models that can explain a given observed dataset. The description length is chosen to be the sum of the lengths of the message…
In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph $G$, we say that a plane subgraph $H\subseteq G$ is a \textit{plane-saturated subgraph} if adding any edge (possibly with…
The scattering patterns near the primary rainbow of oblate drops are simulated by extending the vectorial complex ray model (VCRM) [1] to three-dimensional (3D) calculations. With the curvature of wavefront as intrinsic property of a ray,…