Related papers: New Constructions of Optimal $(r,\delta)$-LRCs via…
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been…
Let $E$ be an elliptic curve over an algebraically closed field of characteristic 0. We prove that the pre-Bloch group of the function field of $E$ can be generated by the functions of degree not higher than 3. We apply this result to the…
In this article we investigate the automorphism group of an asymptotically optimal tower of function fields introduced by Garcia and Stichtenoth. In particular we provide a detailed description of the decomposition group of some rational…
Given $L\geq 1$, we discuss the problem of determining the highest $\alpha=\alpha(L)$ such that any solution to a homogeneous elliptic equation in divergence form with ellipticity ratio bounded by $L$ is in $C^\alpha_{\rm loc}$. This…
This note introduces a new analytic approach to the solution of a very general class of finite-horizon optimal control problems formulated for discrete-time systems. This approach provides a parametric expression for the optimal control…
We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…
This paper introduces the notion of upper-linearizable/quadratizable functions, a class that extends concavity and DR-submodularity in various settings, including monotone and non-monotone cases over different convex sets. A general…
We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a…
The presence of outliers can significantly degrade the performance of ellipse fitting methods. We develop an ellipse fitting method that is robust to outliers based on the maximum correntropy criterion with variable center (MCC-VC), where a…
Current research suggests the use of a liner quadratic performance index for optimal control of regulators in various applications. Some examples include correcting the trajectory of rocket and air vehicles, vibration suppression of…
This is the first paper in a series where we study arithmetic applications of the multiple elliptic Gamma functions originated from mathematical physics. The main purpose of this paper is the introduction of a framework for applications of…
This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task…
We introduce an equilibrium formulation of the functional renormalization group (fRG) for inhomogeneous systems capable of dealing with spatially finite-ranged interactions. In the general third order truncated form of fRG, the dependence…
In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…
We consider the Hardy-Littlewood maximal function associated with ball averages on spaces with exponential volume growth. We focus on discrete groups with balls defined by invariant metrics associated with a variety of length functions.…
We investigate the optimal design of networks for a general transport system. Our network is built from a regular two-dimensional ($d=2$) square lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij}…
Many exciting robotic applications require multiple robots with many degrees of freedom, such as manipulators, to coordinate their motion in a shared workspace. Discovering high-quality paths in such scenarios can be achieved, in principle,…
We give a framework for generalizing LDPC code constructions that use Transversal Designs or related structures such as mutually orthogonal Latin squares. Our construction offers a broader range of code lengths and codes rates. Similar…
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…
This thesis makes several significant contributions to the theory of both Regenerating (RG) and Locally Recoverable (LR) codes. The two principal contributions are characterizing the optimal rate of an LR code designed to recover from $t$…