相关论文: On local equilibrium equations for clustering stat…

The local properties problem of Erd\H{o}s and Shelah generalizes many Ramsey problems and some distinct distances problems. In this work, we derive a variety of new bounds for the local properties problem and its variants. We do this by…

We propose a unifying framework for characterizing pure and mixed state phases of matter across equilibrium, non equilibrium, and metastable regimes. We introduce the concept of locally stable states, defined by the operational property…

In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…

We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$-colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured,…

We address general-shaped clustering problems under very weak parametric assumptions with a two-step hybrid robust clustering algorithm based on trimmed k-means and hierarchical agglomeration. The algorithm has low computational complexity…

We establish the existence of martingale solutions to a class of stochastic conservation equations. The underlying models correspond to random perturbations of kinetic models for collective motion such as the Cucker-Smale and Motsch-Tadmor…

Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…

We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph $G$, an integer $c$ and an ordered list of integers $\{b_1, b_2, \ldots, b_c\}$, \bcp asks whether there exists a…

Reaction-diffusion equations on infinite graphs can have an infinite number of stationary solutions. These solutions are generally described as roots of a countable system of algebraic equations. As a generalization of periodic stationary…

We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of `qualities' or `spins' that is permuted by the gain group. (An example is the Potts model.) The number of totally…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

The problem of coloring the edges of an $n$-node graph of maximum degree $\Delta$ with $2\Delta - 1$ colors is one of the key symmetry breaking problems in the area of distributed graph algorithms. While there has been a lot of progress…

We introduce SAFT-P, a plaquette-level extension of Statistical Associating Fluid Theory for patchy particles. By treating local clusters as associating superparticles and contracting their free energy back to monomer densities, SAFT-P…

Some superlinear fourth order elliptic equations are considered. Ground states are proved to exist and to concentrate at a point in the limit. The proof relies on variational methods, where the existence and concentration of nontrivial…

Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

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,…

The higher-order correlation clustering problem for a graph $G$ and costs associated with cliques of $G$ consists in finding a clustering of $G$ so as to minimize the sum of the costs of those cliques whose nodes all belong to the same…

We consider the 1-equivariant energy critical wave maps problem with two-sphere target. Using a method based on matched asymptotic expansions, we construct infinite time relaxation, blow-up, and intermediate types of solutions that have…