Related papers: On Vertex Identifying Codes For Infinite Lattices
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
We introduce two new classes of covering codes in graphs for every positive integer $r$. These new codes are called local $r$-identifying and local $r$-locating-dominating codes and they are derived from $r$-identifying and…
PhD thesis concerning cohomological finiteness conditions of infinite discrete groups. Much of the material in this thesis has also appeared in arXiv:1311.7629, arXiv:1310.6262, arXiv:1311.6156, and arXiv:1207.1597.
PhD dissertation consists in three lines of investigation involving rational elliptic surfaces, namely 1) a study of conic bundles on these surfaces; 2) an investigation of the possible intersection numbers of two sections and 3) a theorem…
One important issue implied by the finite nature of real-world networks regards the identification of their more external (border) and internal nodes. The present work proposes a formal and objective definition of these properties, founded…
Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…
In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…
This PhD thesis has the following structure: Chapter 1 - General introduction; Chapter 2 - Preliminaries; Chapter 3 - The Replicated Transfer Matrix; Chapter 4 - Finite Size Corrections On Random Graphs; Chapter 5 - The Random Field Ising…
This is my Ph.D. thesis defended earlier this year. It contains mostly information already presented in previous Bielefeld/Saclay papers on this subject, though in more detailed form. It also includes actual calculations and some…
This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…
I review a selection of recent finite temperature lattice results of the past years. First I discuss the extension of the equation of state towards high temperatures and fi- nite densities, then I show recent results on the QCD topological…
Generalizations of QCD in which the number of colors N is taken to infinity are characterized by profound mathematical properties, with far-reaching implications for fundamental problems and for phenomenological issues alike. In this…
The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…