相关论文: Combinatorics of Dyadic Intervals: Consistent Colo…
We study the effects of time and space correlations of an external additive colored noise on the steady-state behavior of a Time-Dependent Ginzburg-Landau model. Simulations show the existence of nonequilibrium phase transitions controlled…
We study dynamic conflict-free colorings in the plane, where the goal is to maintain a conflict-free coloring (CF-coloring for short) under insertions and deletions. - First we consider CF-colorings of a set $S$ of unit squares with respect…
The first step in investigating colour symmetries for periodic and aperiodic systems is the determination of all colouring schemes that are compatible with the symmetry group of the underlying structure, or with a subgroup of it. For an…
Coupled lasers offer a promising approach to scaling the power output of photonic devices for applications demanding high frequency precision and beam coherence. However, maintaining coherence among lasers remains a fundamental challenge…
Let L_1, ..., L_d be pairwise disjoint collections of lines in a d-dimensional vector space over some field. If the collections are sufficiently generic we prove that there exists a d-colouring of the set of multijoints J such that for each…
We analyze different data of the variation of the fine structure constant obtained with different methods to check their consistency.We test consistency using the modified Student test and confidence intervals. We split the data sets in…
In this paper, the aim is multi-illumination color constancy. However, most of the existing color constancy methods are designed for single light sources. Furthermore, datasets for learning multiple illumination color constancy are largely…
For given non-consistent initial conditions, we study the stability of a class of generalised linear systems of difference equations with constant coefficients and taking into account that the leading coefficient can be a singular matrix.…
We investigate a family of relational systems arising from interval partitions of $\omega$, inspired by Vojt\'a\v{s}'s characterization of the bounding and dominating numbers. By varying the underlying asymptotic quantifiers and interval…
In this paper we study the problem of coloring a unit interval graph which changes dynamically. In our model the unit intervals are added or removed one at the time, and have to be colored immediately, so that no two overlapping intervals…
The paper is devoted to the problem of resonances in one-dimensional disordered systems. Some of the previous results are reviewed and a number of new ones is presented. These results pertain to different models (continuous as well as…
We study an interplay between delay and discontinuous hysteresis in dynamical systems. After having established existence and uniqueness of solutions, we focus on the analysis of stability of periodic solutions. The main object we study is…
We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…
We show that a large class of stochastic heat equations can be approximated by systems of interacting stochastic differential equations. As a consequence, we prove various comparison principles extending earlier results. Among other things,…
An initial-boundary value problem for the 1D self-adjoint parabolic equation on the half-axis is solved. We study a broad family of two-level finite-difference schemes with two parameters related to averagings both in time and space.…
Colorization is a traditional computer vision task and it plays an important role in many time-consuming tasks, such as old film restoration. Existing methods suffer from unsaturated color and temporally inconsistency. In this paper, we…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
We consider the coloring of certain distance graphs on the Euclidean plane. Namely, we ask for the minimal number of colors needed to color all points of the plane in such a way that pairs of points at distance in the interval $[1,b]$ get…
We study the infinite graph of $n$-dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It…
We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.