相关论文: A generalization of the 3d distance theorem

Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\Gamma(n,k)_{q}$ the restriction of…

Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquitous, and clustering and classification over graphs arise in…

We consider a distance-regular graph $\G$ with diameter $d \ge 3$ and eigenvalues $k=\theta_0>\theta_1>... >\theta_d$. We show the intersection numbers $a_1, b_1$ satisfy $$ (\theta_1 + {k \over a_1+1}) (\theta_d + {k \over a_1+1}) \ge -…

Using kicked differential equations of motion with derivatives of noninteger orders, we obtain generalizations of the dissipative standard map. The main property of these generalized maps, which are called fractional maps, is long-term…

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

For $q$ a prime power and $\phi$ a rational function with coefficients in $\mathbb{F}_q$, let $p(q,\phi)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_q)$ that is periodic with respect to $\phi$. And if $d$ is a positive integer, let $Q_d$…

The Three Gap Theorem, also known as the Steinhaus Conjecture, is a classical result on the combinatorics of the fractional part function, and has since been generalized in many ways. In this paper, we pose a new problem related to these…

Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.

Given a non-decreasing function $f \colon \mathbb{N} \to \mathbb{N}$ we define a single player game on (infinite) connected graphs that we call fire retaining. If a graph $G$ admits a winning strategy for any initial configuration (initial…

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let $X$ be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension $d$. Informally, the theorem states that if $X$…

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…

In this paper, we obtain some sufficient conditions to guarantee the existence of multiple points of maps from $S^m$ to $\mathbb{R}^d$. Our main tool is the ideal-valued index of $G$-space defined by E. Fadell and S. Husseini. We obtain…

We establish global universal approximation theorems on spaces of piecewise linear paths, stating that linear functionals of the corresponding signatures are dense with respect to $L^p$- and weighted norms, under an integrability condition…

In this paper we study sets of points in the plane with rational distances from r prescribed points P_1, ...,P_r. A crucial case arises for r = 3, where we provide simple necessary and sufficient conditions for the density of this set in…

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

We prove that there exist functions $f,g:\mathbb{N}\to\mathbb{N}$ such that for all nonnegative integers $k$ and $d$, for every graph $G$, either $G$ contains $k$ cycles such that vertices of different cycles have distance greater than $d$…

Let $X$ be a compact subset of the complex plane. It is shown that if a point $x_0$ admits a bounded point derivation on $R^p(X)$, the closure of rational function with poles off $X$ in the $L^p(dA)$ norm, for $p >2$ and if $X$ contains an…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…