相关论文: Combinatorics of Dyadic Intervals: Consistent Colo…
Synchronization among globally coupled, chaotic map lattices can be related to stable periodic windows in isolated chaotic maps. This relation provides a simple predictive tool for the understanding of complicated behavior in coupled…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
This paper presents the first end-to-end network for exemplar-based video colorization. The main challenge is to achieve temporal consistency while remaining faithful to the reference style. To address this issue, we introduce a recurrent…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…
An \emph{interval $t$-coloring} of a graph $G$ is a proper edge-coloring with colors $1,\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A graph $G$ is called \emph{interval…
We present a picture of phase transitions of the system with colored multiplicative noise. Considering the noise amplitude as the power-law dependence of the stochastic variable $x^a$ we show the way to phase transitions disorder-order and…
We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every path of the graph the maximum color…
CONTENTS. 1.Introduction, 1.1 QCD ideas to be tested; 2. Coherence phenomena in QED, 2.1 Charge transparency, 2.2 Charge filtering, 2.3 Charge opacity; 3. Color transparency in perturbative QCD, 3.1 Coherence length in QCD, 3.2 Bjorken…
Given a set D of positive integers, the associated distance graph on the integers is the graph with the integers as vertices and an edge between distinct vertices if their difference lies in D. We investigate the chromatic numbers of…
This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
In this paper, we are interested in reiterated periodic homogenization for a family of parabolic problems with nonstandard growth monotone operators leading to Orlicz spaces. The aim of this work is the determination of the global…
We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give…
Instabilities and pattern formation is the rule in nonequilibrium systems. Selection of a persistent lengthscale, or coarsening (increase of the lengthscale with time) are the two major alternatives. When and under which conditions one…
This paper is concerned with a family of second-order elliptic systems in divergence form with rapidly oscillating periodic coefficients. We initiate the study of homogenization and boundary layers for Neumann problems with first-order…
One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…
We provide an analytic solution to the coupled-mode equations describing the steady-state of a single periodically-modulated optical resonator driven by a monochromatic input. The phenomenology of this system was qualitatively understood…
An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive…