相关论文: On the Asymptotic Order of Circuit Codes

Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l at least four and at most n/2. We prove this conjecture for…

In this note we obtain a new bound for the acyclic edge chromatic number $a'(G)$ of a graph $G$ with maximum degree $D$ proving that $a'(G)\leq 3.569(D-1)$. To get this result we revisit and slightly modify the method described in [Giotis,…

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new,…

The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrained as in previous works. The paper characterizes the optimum…

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

Let $\mathscr{H}$ be a family of digraphs. A digraph $D$ is \emph{$\mathscr{H}$-free} if it contains no isomorphic copy of any member of $\mathscr{H}$. For $k\geq2$, we set $C_{\leq k}=\{C_{2}, C_{3},\ldots,C_{k}\}$, where $C_{\ell}$ is a…

The fundamental dispersion limit for optical communication based the On-Off-Keying format is calculated. It is shown both analytically and with numerical simulations that an OOK optical sequence, which passes through spectrally narrow…

For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…

The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…

We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…

A systematic convolutional encoder of rate $(n-1)/n$ and maximum degree $D$ generates a code of free distance at most ${\cal D} = D+2$ and, at best, a column distance profile (CDP) of $[2,3,\ldots,{\cal D}]$. A code is \emph{Maximum…

Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…

For a finite set $A$ of size $n$, an ordering is an injection from $\{1,2,\ldots,n\}$ to $A$. We present results concerning the asymptotic properties of the length $L_n$ of the longest arithmetic subsequence in a random ordering of an…

How can $d+k$ vectors in $\mathbb{R}^d$ be arranged so that they are as close to orthogonal as possible? In particular, define $\theta(d,k):=\min_X\max_{x\neq y\in X}|\langle x,y\rangle|$ where the minimum is taken over all collections of…

Let G be a graph of order n and let q(G) be that largest eigenvalue of the signless Laplacian of G. In this note it is shown that if k>1 and q(G)>=n+2k-2, then G contains cycles of length l whenever 2<l<2k+3. This bound is asymptotically…

We show that the permanent cannot be computed by DLOGTIME-uniform threshold or arithmetic circuits of depth o(log log n) and polynomial size.

We study theoretically the optical conductivity of d-wave superconductors like in high temperature cuprates in the presence of impurities. We limit ourselves at T=0K and focus on the frequency dependence of both sigma_1(omega) and…