English
Related papers

Related papers: Combinatorics of Dyadic Intervals: Consistent Colo…

200 papers

The synchronization problem is investigated for the class of locally strongly transitive automata introduced in a previous work of the authors. Some extensions of this problem related to the notions of stable set and word of minimal rank of…

Formal Languages and Automata Theory · Computer Science 2011-11-24 Arturo Carpi , Flavio D'Alessandro

Given a hypergraph $H$, the conflict-free colouring problem is to colour vertices of $H$ using minimum colours so that each hyperedge in $H$ sees a unique colour. We present a polynomial time reduction from the conflict-free colouring…

Data Structures and Algorithms · Computer Science 2020-01-02 S. M. Dhannya , N. S. Narayanaswamy

We study the existence and stability of cnoidal periodic wave arrays propagating in uniform quadratic nonlinear media and discover that they become completely stable above a threshold light intensity. To the best of our knowledge, this is…

In this note we present a brief overview of variational methods to solve homogenization problems. The purpose is to give a first insight on the subject by presenting some fundamental theoretical tools, both classical and modern. We conclude…

Optimization and Control · Mathematics 2015-03-19 José Matias , Marco Morandotti

In this paper we extend previous results on convergent perturbative solutions of the Schroedinger equation of a class of periodically time-dependent two-level systems. The situation treated here is particularly suited for the investigation…

Mathematical Physics · Physics 2015-06-26 J. C. A. Barata , D. A. Cortez

The project has carried out the re-optimization of image coloring in accordance with the existing Autocolorization direction model DDColor. For the experiments on the existing weights of DDColor, we found that it has limitations in some…

Computer Vision and Pattern Recognition · Computer Science 2025-10-28 Yun Kai Zhuang

An edge-coloring of a graph $G$ with consecutive integers $c_{1},\ldots,c_{t}$ is called an \emph{interval $t$-coloring} if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of…

Combinatorics · Mathematics 2015-08-04 Petros A. Petrosyan , Hayk H. Tepanyan

We study the expanding properties of random perturbations of regular interval maps satisfying the summability condition of exponent one. Under very general conditions on the interval maps and perturbation types, we prove strong stochastic…

Dynamical Systems · Mathematics 2014-02-26 Weixiao Shen

An edge-coloring of a graph $G$ with colors $1,...,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval…

Combinatorics · Mathematics 2012-02-02 Petros A. Petrosyan , Hrant H. Khachatrian , Hovhannes G. Tananyan

We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…

Combinatorics · Mathematics 2024-08-08 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

We discuss the higher order stabilization of the coefficients of the colored Jones polynomial. In particular, we find an expression for the second stable sequence of the colored Jones polynomial of a certain class of knots. We also…

Geometric Topology · Mathematics 2017-06-26 Katherine Walsh

A proper edge-coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval of consecutive integers. Interval thickness s(G) of a graph G is the smallest number of interval colorable graphs…

Combinatorics · Mathematics 2022-05-13 Maria Axenovich , Michael Zheng

Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…

Combinatorics · Mathematics 2020-08-06 Kyle MacKeigan , Jeannette Janssen

We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high…

Disordered Systems and Neural Networks · Physics 2009-11-10 A. Braunstein , R. Mulet , A. Pagnani , M. Weigt , R. Zecchina

An edge coloring of a graph $G$ with colors $1,2,..., t$ is called an interval $t$-coloring if for each $i\in \{1,2,...,t\}$ there is at least one edge of $G$ colored by $i$, the colors of edges incident to any vertex of $G$ are distinct…

Discrete Mathematics · Computer Science 2009-11-30 R. R. Kamalian , P. A. Petrosyan

Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…

Combinatorics · Mathematics 2020-09-23 Amin Bahmanian , Sadegheh Haghshenas

This paper is concerned with homogenization of systems of linear elasticity with rapidly oscillating periodic coefficients. We establish sharp convergence rates in $L^2$ for the mixed boundary value problems with bounded measurable…

Analysis of PDEs · Mathematics 2017-02-14 Zhongwei Shen , Jinping Zhuge

For a family of second-order parabolic systems with rapidly oscillating and time-dependent periodic coefficients, we investigate the asymptotic behavior of fundamental solutions and establish sharp estimates for the remainders.

Analysis of PDEs · Mathematics 2017-11-30 Jun Geng , Zhongwei Shen

In this paper, we consider a linear heat equation with constant coefficients and a single constant delay. Such equations are commonly used to model and study various problems arising in ecology and population biology when describing the…

Analysis of PDEs · Mathematics 2014-01-23 Denys Khusainov , Michael Pokojovy , Elvin Azizbayov

We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.

Combinatorics · Mathematics 2020-10-06 Zdeněk Dvořák , Luke Postle
‹ Prev 1 3 4 5 6 7 10 Next ›