Related papers: Superposition de calques monochromes d'opacit\'es …

Let G = (V, E) be a multigraph without loops and for any x {\in}V let E(x) be the set of edges of G incident to x. A homogeneous edge-coloring of G is an assignment of an integer m >= 2 and a coloring c:E {\to} S of the edges of…

Using results from scaling laws, this theoretical note argues that the following two statements cannot be simultaneously true: 1. Superposition hypothesis where sparse features are linearly represented across a layer is a complete theory of…

Optical microscopy is believed to be an efficient method for identifying layer number of two-dimensional 2D materials. However, since illuminants, cameras and their parameters are different from lab to lab, it is impossible to identify…

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections…

In this article, we present a geometrical proof of sum of $\cos n\varphi$ where $n$ goes from $1$ up to $m$. Although there exist some summation forms and the proofs are simple, they use complex numbers. Our proof comes from a geometrical…

In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…

We discuss a problem posed by Ronald Graham about the minimum number, over all 2-colorings of $[1,n]$, of monochromatic $\{x,y,x+ay\}$ triples for $a \geq 1$. We give a new proof of the original case of $a=1$. We show that the minimum…

In the present paper, using S.L. Sobolev's method, interpolation spline that minimizes the expression $\int_0^1(\varphi^{(m)}(x)+\omega^2\varphi^{(m-2)}(x))^2dx$ in the $K_2(P_m)$ space are constructed. Explicit formulas for the…

We have used scanning probe microscopy to investigate self-assembled monolayers of chemically synthesized peptides. We find that the peptides form a dense uniform monolayer, above which is found a sparse additional layer. Using scanning…

We answer a question of Gy\'arf\'as and S\'ark\"ozy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of different colours. We also give a lower bound for the…

A well-known consequence of Schur's theorem is that for $r\in \mathbb{N}$, if $n$ is sufficiently large, then any $r$-colouring of $[n]$ results in monochromatic $a,b,c\in [n]$ such that $ab=c$. In this paper we are interested in the…

In this paper, we theoretically investigate a particular experimental setup which coalesces the concepts of the double slit and single slit diffraction. In Thomas Young's classic double slit experiment, monochromatic plane light wave…

Let $\chi_l(G)$ denote the list chromatic number of the $r$-uniform hypergraph~$G$. Extending a result of Alon for graphs, Saxton and the second author used the method of containers to prove that, if $G$ is simple and $d$-regular, then…

We develope in great computational details the classical Cartan equivalence problem for Levi-nondegenerate C^6-smooth real hypersurfaces M^3 in C^2, performing all calculations effectively in terms of a (local) graphing function \varphi. In…

The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…

Given a density operator $\hat \rho$ the optical tomography map defines a one-parameter set of probability distributions $w_{\hat \rho}(X,\phi),\ \phi \in [0,2\pi),$ on the real line allowing to reconstruct $\hat \rho $. We introduce a dual…

In this paper, a generalization of cloaking is presented: instead of an empty region of space, an inhomogeneous structure is transformed via Pendry's map in order to give, to any object hidden in the central hole of the cloak, a completely…

For $k\ge 1$, we consider interleaved $k$-tuple colorings of the nodes of a graph, that is, assignments of $k$ distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly…

The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…

We consider the problem of minimizing the number of monochromatic subgraphs of a random graph, when each node of the host graph is assigned one of the two colors. Using a recently discovered contiguity between appearance of strictly…