相关论文: An application of CAT
An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an…
We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.
An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…
We show that for any regular cardinal $\kappa$, $\square_{\kappa, 2}$ is consistent with "all $\kappa^+$-Aronszajn trees are special." By a result of Shelah and Stanley this is optimal in the sense that $\square_{\kappa, 2}$ may not be…
Measures on Fra\"iss\'e classes are a key input in the Harman--Snowden (2022) construction of tensor categories. Treelike Fra\"iss\'e classes provide a particularly tractable source of examples. In this paper, we complete the classification…
We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…
We construct a large family of normal $\kappa$-complete $\mathbb{R}_\kappa$-embeddable non-special $\kappa^+$-Aronszajn trees which have no club isomorphic subtrees using an instance of the proxy principle of Brodsky-Rinot.
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing…
In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the goal is to find a properly colored spanning tree, i.e., a spanning tree in which any two adjacent edges have distinct colors. The problem…
Computerized Adaptive Testing (CAT) measures an examinee's ability while adapting to their level. Both too many questions and too many hard questions can make a test frustrating. Are there some CAT algorithms which can be proven to be…
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number…
In this paper, we investigate the weighted tree augmentation problem (TAP), where the goal is to augment a tree with a minimum cost set of edges such that the graph becomes two edge connected. First we show that in weighted TAP, we can…
Let $G$ be a simple graph with $n$ vertices and list chromatic number $\chi_\ell(G)=\chi_\ell$. Suppose that $0\leq t\leq \chi_\ell$ and each vertex of $G$ is assigned a list of $t$ colors. Albertson, Grossman and Haas [1] conjectured that…
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…
Coloured Jones and Alexander polynomials are sequences of quantum invariants recovering the Jones and Alexander polynomials at the first terms. We show that they can be seen conceptually in the same manner, using topological tools, as…
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$ edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower bound…
Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…
We compute the one-loop contributions from a color octet scalar to the tensor anomalous couplings of top and bottom quarks to gluons, photons and W bosons. We use known constraints on the parameters of the model to compare the predicted…
Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…