Related papers: Curves on torus layers and coding for continuous a…
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been…
Ruled surfaces play an important role in various types of design, architecture, manufacturing, art, and sculpture. They can be created in a variety of ways, which is a topic that has been the subject of much discussion in mathematics and…
In practical systems, reliable communication is often accomplished by coding at different network layers. We question the necessity of this approach and examine when it can be beneficial. Through conceptually simple probabilistic models…
Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this…
These lectures give a short introduction to the study of curves on algebraic varieties. After an elementary proof of the dimension formula for the space of curves, we summarize the basic properties of uniruled and of rationally connected…
In this paper, we study residues of differential 2-forms on a smooth algebraic surface over an arbitrary field and give several statements about sums of residues. Afterwards, using these results we construct algebraic-geometric codes which…
Twist defects in surface codes can be used to encode more logical qubits, improve the code rate, and implement logical gates. In this work we provide a rigorous formalism for constructing surface codes with twists generalizing the…
We provide a simple linear time transformation from a directed or undirected graph with labeled edges to an unlabeled digraph, such that paths in the input graph in which no two consecutive edges have the same label correspond to paths in…
This paper addresses network code design for robust transmission of sources over an orthogonal two-hop wireless network with a broadcasting relay. The network consists of multiple sources and destinations in which each destination,…
The paper studies intrinsic geometry in the tropical plane. Tropical structure in the real affine $n$-space is determined by the integer tangent vectors. Tropical isomorphisms are affine transformations preserving the integer lattice of the…
The availability of graph data with node attributes that can be either discrete or real-valued is constantly increasing. While existing kernel methods are effective techniques for dealing with graphs having discrete node labels, their…
We study a generalization of constant Gauss curvature -1 surfaces in Euclidean 3-space, based on Lorentzian harmonic maps, that we call pseudospherical frontals. We analyze the singularities of these surfaces, dividing them into those of…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
In this paper, we present a new explicit formula for the curvatures of a regular curve with an arbitrary parameter in the Euclidean space $\mathbb{R}^n$, $n\geq 2$, expressed only in terms of its derivatives. We introduce also the notion of…
The geodesic total curvature of rectifiable spherical curves is analyzed. We extend to the case of high dimension spheres the explicit formula that holds true for curves supported into the 2-sphere. For this purpose, we take advantage of…
We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…
In this paper, we investigate the impact of neural networks (NNs) topology on adversarial robustness. Specifically, we study the graph produced when an input traverses all the layers of a NN, and show that such graphs are different for…
Astronomy light curves are sparse, gappy, and heteroscedastic. As a result standard time series methods regularly used for financial and similar datasets are of little help and astronomers are usually left to their own instruments and…
In analogy to classical spherical t-design points, we introduce the concept of t-design curves on the sphere. This means that the line integral along a t-design curve integrates polynomials of degree t exactly. For low degrees we construct…
We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is…