Related papers: Illumination by Tangent Lines

We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

We construct explicit examples of cubic surfaces over $\bbQ$ such that the 27 lines are acted upon by the index two subgroup of the maximal possible Galois group. This is the simple group of order $25 920$. Our examples are given in…

We survey index theorems counting eigenvalues of linearized Hamiltonian systems and characteristic values of polynomial operator pencils. We present a simple common graphical interpretation and generalization of the index theory using the…

A mapping from the vertex set of a graph G = (V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a…

Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\bar{c}(v)$ for every $v$ in…

A graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishing number $D(G)$ is the least integer $k$ for which $G$ is…

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

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 show that if $G$ is a gap-free and diamond-free graph, then $I(G)^s$ has a linear minimal free resolution for every $s\geq 2$.

We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…

A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the…

Following the pioneering work of Iommi-Kiwi and Jenkinson-Pollicott-Vytnova, we continue to study the inflection points of the Lyapunov spectrum in this work. We prove that for any 3-branch piecewise linear expanding map on an interval, the…

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…

Given a polynomial $f$ with coefficients in a field of prime characteristic $p$, it is known that there exists a differential operator that raises $1/f$ to its $p$th power. We first discuss a relation between the `level' of this…

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…

We show that if a Laurent series $f\in\mathbb{C}((t))$ satisfies a particular kind of linear iterative equation, then $f$ is either a rational function or it is differentially transcendental over $\mathbb{C}(t)$. This condition is more…

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function $f$ such that if the tree-width of a graph $G$ with $k$ pairs of terminals is at least $f(k)$, then $G$ contains a…

If (V,0) is an isolated complete intersection singularity and X a holomorphic vector field tangent to V one can define an index of X, the so called GSV index, which generalizes the Poincare-Hopf index. We prove that the GSV index coincides…

We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…