相关论文: The Teneva Game

Let $G$ be a finite group of order divisible by a prime $p$. The number of $p$-regular and $p'$-regular conjugacy classes of $G$ is at least $2\sqrt{p-1}$. Also, the number of $p$-rational and $p'$-rational irreducible characters of $G$ is…

Given a knot, we develop methods for finding the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of $K$, following an approach developed by…

This paper is motivated by a recent result of Wolf \cite{wolf} on the minimum number of monochromatic 4-term arithmetic progressions(4-APs, for short) in $\Z_p$, where $p$ is a prime number. Wolf proved that there is a 2-coloring of $\Z_p$…

Tur\'{a}n number $T(n,5,3)$ is the minimum size of a system of triples out of a base set $X$ of $n$ elements such that every quintuple in $X$ contains a triple from the system. The exact values of $T(n,5,3)$ are known for $n \leq 17$.…

The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…

The resistance $r(G)$ of a graph $G$ is the minimum number of edges that have to be removed from $G$ to obtain a graph which is $\Delta(G)$-edge-colorable. The paper relates the resistance to other parameters that measure how far is a graph…

We derive an upper bound for the least number of variables needed to guarantee that a system of t quadratic forms (t>=2) over a field F has a nontrivial zero. In particular, if F is a local field, then 2t^2+3 variables insure the existence…

Given an undirected graph $G = (V,E)$, a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of…

We investigate the upper chromatic number of the hypergraph formed by the points and the $k$-dimensional subspaces of $\mathrm{PG}(n,q)$; that is, the most number of colors that can be used to color the points so that every $k$-subspace…

A petal diagram of a knot is a projection with a single multi-crossing such that there are no nested loops. The petal number $p(K)$ of a knot $K$ is the minimum number of loops among all petal diagrams of $K$. Let $T_{n,s}$ denote the…

We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The goal is to visit every vertex of the graph, return to the…

An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\it $k$-rainbow connected} if one can…

The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is monochromatic. We show that every graph of maximum degree…

In an undirected graph, a conflict-free coloring (with respect to open neighborhoods) is an assignment of colors to the vertices of the graph $G$ such that every vertex in $G$ has a uniquely colored vertex in its open neighborhood. The…

In this short note, we provide an explicit formula to compute every colored double Tornheim's series by using double polylogarithm values at roots of unity. When the colors are given by $\pm 1$ our formula is different from that of Tsumura…

The smallest integer $k$ needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing and Behzed conjectured that the total coloring can be…

We consider a generalization of Sperner's lemma for a triangulation $T$ of $(m+1)$-discs $D$ whose vertices are colored in $n+2$ colors. A proper coloring of $T$ on the boundary of $D$ determines a simplicial mapping $f:S^m \to S^n$ and the…

In this paper I study a variant of the general vertex coloring problem called precoloring. Specifically, I study graph precolorings, by developing new theory, for characterizing the minimal non-extensible precolorings. It is interesting per…

Let $\ell \geq 5$ be a prime and let $N$ be a square-free integer prime to $\ell$. For each prime $p$ dividing $N$, let $a_p$ be either $1$ or $-1$. We give sufficient criteria for the existence of a newform $f$ of weight 2 for…

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…