Related papers: Illumination by Tangent Lines
Given integers $2 \leq p \leq c \leq q$, we construct a finite simple graph $G$ with $\nu_1(G) = p$ and $\nu(G) = q$ for which the squarefree power $I(G)^{[k]}$ of the edge ideal $I(G)$ of $G$ has linear quotients for each $c \leq k \leq q$…
The total light deflection represents a concept, which allows one to decide which multipoles need to be implemented in the light trajectory for a given astrometric accuracy. The fundamental quantity of total light deflection is the tangent…
We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…
Let $f,g\in\overline{\mathbb{Q}}[z]$ be polynomials of degree $d\geq2$ with disconnected Julia sets. We prove that they have the same Lyapunov exponent $\mathcal{L}_f=\mathcal{L}_g$ if and only if either $f$ and $g$ are intertwined, or $f$…
We prove that if $f(x) = \sum_{k=0}^\infty a_k x^k,$ $a_k >0, $ is an entire function such that the sequence $Q := \left( \frac{a_k^2}{a_{k-1}a_{k+1}} \right)_{k=1}^\infty$ is non-decreasing and $\frac{a_1^2}{a_{0}a_{2}} \geq 2\sqrt[3]{2},$…
Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point.…
Proving linear inequalities and identities of Shannon's information measures, possibly with linear constraints on the information measures, is an important problem in information theory. For this purpose, ITIP and other variant algorithms…
We consider the number of visible lattice points under the assumption of the Extended Lindel\"{o}f Hypothesis. We get a relation between visible lattice points and the Extended Lindel\"{o}f Hypothesis. And we also get a relation between…
Given a graph $G$, a \textit{$k$-total difference labeling} of the graph is a total labeling $f$ from the set of edges and vertices to the set $\{1, 2, \cdots k\}$ satisfying that for any edge $\{u,v\}$, $f(\{u,v\})=|f(u)-f(v)|$. If $G$ is…
This article studies real roots of the flow polynomial $F(G,\lambda)$ of a bridgeless graph $G$. For any integer $k\ge 0$, let $\xi_k$ be the supremum in $(1,2]$ such that $F(G,\lambda)$ has no real roots in $(1,\xi_k)$ for all graphs $G$…
A $k$-L(2,1)-labeling of a graph is a function from its vertex set into the set $\{0,...,k\}$, such that the labels assigned to adjacent vertices differ by at least 2, and labels assigned to vertices of distance 2 are different. It is known…
The F-index of a graph $G$ is the sum of the cubes of the degrees of the vertices of $G$. In this paper, explicit expressions for the F-index of different transformation graphs of type ${{G}^{xyz}}$ with $x, y, z\in \{-, + \}$ are obtained.…
Two methods of refractometry in reflected light from optical surface of samples are considered and studied experimentally. Methods are grounded on results of Fresnel theory of concerning light reflectivity at near normal incidence and…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…
For the ideal $I = \langle y_1 + \dots + y_n, y^2_1, \dots , y^2_n \rangle$ in $R = {\mathbb F}[y_1, \dots , y_n]$ with char($\mathbb F$) = 0, we show that the reduced Gr\"obner basis with lex-order consists of polynomials $g_\alpha$ that…
Let $F(\boldsymbol x)$ be a homogeneous polynomial in $n \ge 1$ variables of degree $1 \leq d \leq n$ with integer coefficients so that its degree in every variable is equal to $1$. We give some sufficient conditions on $F$ to ensure that…
We establish the linear independence of time-frequency translates for functions $f$ having one sided decay $\lim_{x\to \infty} |f(x)| e^{cx \log x} = 0$ for all $c>0$. We also prove such results for functions with faster than exponential…
Let $E_p(x)$ denote the Artin-Hasse exponential and let $\overline{E}_p(x)$ denote its reduction modulo $p$ in $\mathbb{F}_p[[x]]$. In this article we study transcendence properties of $\overline{E}_p(x)$ over $\mathbb{F}_p[x]$. We give two…
The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$ to the set of all nonnegative integers such that $|f(x)-f(y)| \geq 2$ if $x$ and $y$ are at distance 1, and $f(x)=f(y)$ if $x$ and $y$ are at distance 2, where the…