Related papers: Two Colored Diagrams for Central Configurations of…

Asymptotic stability is with no doubts an essential property to be studied for any system. This analysis often becomes very difficult for coupled systems and even harder when different timescales appear. The singular perturbation method…

One problem which plagues the numerical evaluation of one-loop Feynman diagrams using recursive integration by part relations is a numerical instability near exceptional momentum configurations. In this contribution we will discuss a…

Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…

A distinguishing colouring of a graph is a colouring of the vertex set such that no non-trivial automorphism preserves the colouring. Tucker conjectured that if every non-trivial automorphism of a locally finite graph moves infinitely many…

We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…

We consider the symmetry-breaking steady state bifurcation of a spatially-uniform equilibrium solution of E(2)-equivariant PDEs. We restrict the space of solutions to those that are doubly-periodic with respect to a square or hexagonal…

In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component is of relatively small cardinality. We focus on colorings…

Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least number of colors in such a way that a vertex has a different…

This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…

The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solution of the Four Color Problem. That is why the material of…

In this paper, we study planar polygonal curves from the variational methods. We show an unified interpretation of discrete curvatures and the Steiner-type formula by extracting the notion of the discrete curvature vector from the first…

We present an iterative method for generating the complete set of self-energy Feynman diagrams at arbitrary order for the single-polaron problem with arbitrary linear coupling to the lattice. The approach combines a combinatorial…

The discharging method is a powerful proof technique, especially for graph coloring problems. Its major downside is that it often requires lengthy case analyses, which are sometimes given to a computer for verification. However, it is much…

This paper serves as a first foray on regularisation for planar vector fields. Motivated by singularities in celestial mechanics, the block regularisation of a generic class of degenerate singularities is studied. The paper is concerned…

For a singularly perturbed elliptic model problem with two small parameters, we analyze finite element methods of any order on a Bakhvalov-type mesh. For convergence analysis, we construct a new interpolation by using the characteristics of…

Finite element approximation to a decoupled formulation for the quad--curl problem is studied in this paper. The difficulty of constructing elements with certain conformity to the quad--curl problems has been greatly reduced. For convex…

We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into clusters, we want to choose exactly one vertex per cluster…

The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have…

When applying methods of optimal control to motion planning or stabilization problems, some theoretical or numerical difficulties may arise, due to the presence of specific trajectories, namely, singular minimizing trajectories of the…

We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…