相关论文: Finitely dependent cycle coloring

For an undirected, simple, finite, connected graph $G$, we denote by $V(G)$ and $E(G)$ the sets of its vertices and edges, respectively. A function $\varphi:E(G)\rightarrow\{1,2,\ldots,t\}$ is called a proper edge $t$-coloring of a graph…

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

We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…

We prove that for any coloring of the naturals using two colors there are monochromatic sets of the form $\{x,y,xy,x+iy:i\leq k\}$ and $\{x,y,x^y,xy^i:i\leq k\}$ for any $k$.

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in $T \times \mathbb{R}$, where $T$ denotes a flat 2-tori. Each of our families converges to a foliation of $T \times \mathbb{R}$ by $T$. These…

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…

A single coloring channel is defined by a subset of letters it allows to pass through, while deleting all others. A sequence of coloring channels provides multiple views of the same transmitted letter sequence, forming a type of…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

Some linear dynamical systems over finite fields are studied and the self-similar character of their development is proved. Connections with aperiodic tilings, Delanoy numbers and other topics are also proved. The prime fields F_p have a…

The "necklace process", a procedure constructing necklaces of black and white beads by randomly choosing positions to insert new beads (whose color is uniquely determined based on the chosen location), is revisited. This article illustrates…

We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers $X=X(k, \mu)$ which, when coloured with finitely many colours, contains a monochromatic $k$-term arithmetic progression, whilst every…

Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…

For $k\ge 1$, we consider interleaved $k$-tuple colorings of the nodes of a graph, that is, assignments of $k$ distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly…

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

This contribution presents a simple Finite Element model aimed at efficient simulation of layered glass units. The adopted approach is based on considering independent kinematics of each layer, tied together via Lagrange multipliers.…

Let $c$ be an edge-colouring of a graph $G$ such that for every vertex $v$ there are at least $d \ge 2$ different colours on edges incident to $v$. We prove that $G$ contains a properly coloured path of length 2d or a properly coloured…

We show how few-particle Green's functions can be calculated efficiently for models with nearest-neighbor hopping, for infinite lattices in any dimension. As an example, for one dimensional spinless fermions with both nearest-neighbor and…

The goal of this paper is to establish fundamental properties of the Hochschild, topological Hochschild, and topological cyclic homologies of commutative, Noetherian rings, which are assumed only to be F-finite in the majority of our…

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…