Related papers: Curves on torus layers and coding for continuous a…
In this paper, we prove some fundamental theorems for holomorphic curves on angular domain intersecting a hypersurface, finite set of fixed hyperplanes in general position and finite set of fixed hypersurfaces in general position on complex…
Characterizing the geometry of an object orbiting around a star from its transit light curve is a powerful tool to uncover various complex phenomena. This problem is inherently ill-posed, since similar or identical light curves can be…
A numerical scheme for computing arc-length parametrized curves of low bending energy that are confined to convex domains is devised. The convergence of the discrete formulations to a continuous model and the unconditional stability of an…
We consider the problem of transmission of a sequence of real data produced by a Nyquist sampled band-limited analog source over a band-limited analog channel, which introduces an additive white Gaussian noise. An analog coding scheme is…
Curves are essential concepts that enable compounded aesthetic curves, e.g., to assemble complex silhouettes, match a specific curvature profile in industrial design, and construct smooth, comfortable, and safe trajectories in vehicle-robot…
This paper demonstrates an approach for developing a framework to produce invariants of base-point-free generic spherical curves under some chosen local moves from Reidemeister moves using based chord diagrams. Our invariants not only…
Defects play a key role in the electronic structure of graphene layers flat or curved. Topological defects in which an hexagon is replaced by an n-sided polygon generate long range interactions that make them different from vacancies or…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
We consider the problem of linear network coding over communication networks, representable by directed acyclic graphs, with multiple groupcast sessions: the network comprises of multiple destination nodes, each desiring messages from…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex…
In this paper, we study the special curves and ruled surfaces on helix hypersurface whose tangent planes make a constant angle with a fixed direction in Euclidean n-space Besides, we observe some special ruled surfaces in and give…
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
Recent research in ultra-reliable and low latency communications (URLLC) for future wireless systems has spurred interest in short block-length codes. In this context, we analyze arbitrary harmonic bandwidth (BW) expansions for a class of…
A (positive) locally convex curve in the 2-sphere is a curve with positive geodesic curvature (i.e., which always turns left). In the 3-sphere, it is a curve with positive torsion. In this work we discussed the topology of spaces of such…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…
Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
Given the implicit equation $F(x,y,t,s)$ of a family of algebraic plane curves depending on the parameters $t,s$, we provide an algorithm for studying the topology types arising in the family. For this purpose, the algorithm computes a…