相关论文: Combinatorics of Dyadic Intervals: Consistent Colo…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
An interval 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 i, i=1,2,...,t, and the edges incident to each vertex v\in V(G) are colored by d_{G}(v) consecutive…
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static…
Driven by various kinds of noise, ensembles of limit cycle oscillators can synchronize. In this letter, we propose a general formulation of synchronization of the oscillator ensembles driven by common colored noise with an arbitrary power…
The May-Leonard model for three competing species, symmetric with respect to cyclic permutation of the variables and extended by diffusive terms, is considered. Exact time-periodic solutions of the system have been found, and their…
In this paper it is proved that there exist periodic monohedral tilings and finite seeds of colored tiles, which force non-periodic coloring of the whole plane
Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
The coherent stochastic resonance is observed and studied with multi-step periodic signal in continuous medium having two absorbing boundaries. The general features of this process are exihibited. The universal features at the resonance…
We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We derive a lower bound…
A proper edge $t$-coloring of a graph $G$ is a coloring of edges of $G$ with colors $1,2,...,t$ such that each of $t$ colors is used, and adjacent edges are colored differently. The set of colors of edges incident with a vertex $x$ of $G$…
A classic graph coloring problem is to assign colors to vertices of any graph so that distinct colors are assigned to adjacent vertices. Optimal graph coloring colors a graph with a minimum number of colors, which is its chromatic number.…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
Classical results on aperiodic tilings are rather complicated and not widely understood. Below, an alternative approach is discussed in hope to provide additional intuition not apparent in classical works.
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…
In responding to a question on Math Stackexchange, the author formulated the problem of determining the number of strings of balls colored in most $n$ colors with a number $k$ of repeated colors. In this paper, we formulate the problem more…
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…
We study colored coverage and clustering problems. Here, we are given a colored point set where the points are covered by (unknown) $k$ clusters, which are monochromatic (i.e., all the points covered by the same cluster, have the same…