Related papers: Superposition de calques monochromes d'opacit\'es …
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emph{nonrepetitive chromatic number} of a graph $G$ is the…
In this paper, we provide formulas for the sum of residues of type Camacho-Sad of a holomorphic foliation with respect to an invariant analytic subvariety. As application, in context of projective foliations, we obtain a formula that…
Interpolation Theory gives techniques for constructing spaces from two initial Banach spaces. We provide several conditions under which the restriction of a holomorphic map $f:X_0+X_1 \rightarrow Y_0+Y_1$ to the interpolated spaces (using…
We prove that for an arbitrary $\varepsilon > 0$ holds \[ \chi (\mathbb{R}^3 \times [0,\varepsilon]^6) \geq 10, \] where $\chi(M)$ stands for the chromatic number of an (infinite) graph with the vertex set $M$ and the edge set consists of…
We show that an arbitrary spatial distribution of complex refractive index inside an object can be exactly represented as a sum of two "monomorphous" complex distributions, i.e. the distributions with the ratios of the real part to the…
Background: Spectroscopic factors, overlaps, and isospin symmetry are often used in conjunction with single-particle wave functions for the phenomenological analysis of nuclear structure and reactions. Many differing prescriptions for…
Monochromatic light is prepared by a single slit of spatial width {\Delta}x. The diffraction pattern is considered to obtain the corresponding probability density of the momentum. Let P be the probability weight to measure a momentum in a…
A path in an edge-colored graph $G$ is called monochromatic if any two edges on the path have the same color. For $k\geq 2$, an edge-colored graph $G$ is said to be monochromatic $k$-edge-connected if every two distinct vertices of $G$ are…
We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph $G(n,p)$ on $n$ vertices in which each edge appears independently with probability $p=p(n)$. For dense random graphs ($np \to \infty$ as $n…
Given a sequence of graphs $G_n$ and a fixed graph $H$, denote by $T(H, G_n)$ the number of monochromatic copies of the graph $H$ in a uniformly random $c$-coloring of the vertices of $G_n$. In this paper we study the joint distribution of…
A parameter, called the degree of diffraction, is defined to describe the diffractive spreading of a monochromatic light beam. The same as the degree of paraxiality that was introduced by Gawhary and Severini in Opt. Lett. 33, 1360 (2008),…
The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let $\mathcal{E}$ be a linear equation. Denote by $\operatorname{R}_r(\mathcal{E})$ the minimal integer, if it exists, such that any $r$-coloring of…
Given a class $\mathcal{H}$ of $m$ hypergraphs ${H}_1, {H}_2, \ldots, {H}_m$ with the same vertex set $V$, a cooperative coloring of them is a partition $\{I_1, I_2, \ldots, I_m\}$ of $V$ in such a way that each $I_i$ is an independent set…
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…
Let $\vec{K}_{\mathbb{N}}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a 2-colouring of the edges of $\vec{K}_{\mathbb{N}}$ in which every monochromatic path has…
Recall that van der Waerden's theorem states that any finite coloring of the naturals has arbitrarily long monochromatic arithmetic sequences. We explore questions about the set of differences of those sequences.
Context. Realistic 3D time-dependent simulations of stellar near-surface convection employ the opacity binning method for efficient and accurate computation of the radiative energy exchange. The method provides several orders of magnitude…
We show that in any two-coloring of the positive integers there is a color for which the set of positive integers that can be represented as a sum of distinct elements with this color has upper logarithmic density at least $(2+\sqrt{3})/4$…
The aim of this article is to give a generalization of the Cauchy-Pompeiu integral formula for functions valued in parameter-depending elliptic algebras with structure polynomial $X^2 + \beta X + \alpha$ where $\alpha$ and $\beta$ are real…
Consider random sequential adsorption on a chequerboard lattice with arrivals at rate $1$ on light squares and at rate $\lambda$ on dark squares. Ultimately, each square is either occupied, or blocked by an occupied neighbour. Colour the…