相关论文: Illumination by Taylor Polynomials

The distinguishing index $D'(G)$ of a graph $G$ is the least number of colors necessary to obtain an edge coloring of $G$ that is preserved only by the trivial automorphism. We show that if $G$ is a connected $\alpha$-regular graph for some…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

Assume that $f$ is Dunkl polyharmonic in $\mathbb{R}^n$ (i.e. $(\Delta_h)^p f=0$ for some integer $p$, where $\Delta_h$ is the Dunkl Laplacian associated to a root system $R$ and to a multiplicity function $\kappa$, defined on $R$ and…

We will show that a necessary and sufficient condition for a Ferrers board (or Young Diagrams) to be fully tileable with 1x2 dominoes requires the board to be 2-colorable such that no color is adjacent to its own color using both induction…

An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

The main result of the paper is the following generalization of Forelli's theorem: Suppose F is a holomorphic vector field with singular point at p, such that F is linearizable at p and the matrix is diagonalizable with the eigenvalues…

Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the minimum number of distinct palettes, taken over all…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.

Let $p$ be a polynomial in non-commutative variables $x_1,x_2,\ldots,x_n$ with constant term zero over an algebraically closed field $K$. The object of study in this paper is the image of this kind of polynomial over the algebra of upper…

Let $f$ be a rational function on an algebraic curve over the complex numbers. For a point $p$ and local parameter $x$ we can consider the Taylor series for $f$ in the variable $x$. In this paper we give an upper bound on the frequency with…

We develop two methods for expressing the global index of the gradient of a 2 variable polynomial function $f$: in terms of the atypical fibres of $f$, and in terms of the clusters of Milnor arcs at infinity. These allow us to derive upper…

The generalized list $T$-coloring is a common generalization of many graph coloring models, including classical coloring, $L(p,q)$-labeling, channel assignment and $T$-coloring. Every vertex from the input graph has a list of permitted…

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

The concept of illumination bodies studied in convex geometry is used to amend the halfspace depth for multivariate data. The proposed notion of illumination enables finer resolution of the sample points, naturally breaks ties in the…

We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…