Related papers: A short note on reduced residues
We study $L^2$-constraint minimizing problems related to elliptic systems. We introduce a new rearrangement to show $H^1$-precompactness of any minimizing sequences. Some strict inequality for the new rearrangement is obtained. It is a key…
We consider the following problem: on any given complete Riemannian manifold $(M,g)$, among all curves which have fixed length as well as fixed end-points and tangents at the end-points, minimise the $L^\infty$ norm of the curvature. We…
We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…
For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of…
Maximizing a submodular function is a fundamental task in machine learning and in this paper we study the deletion robust version of the problem under the classic matroids constraint. Here the goal is to extract a small size summary of the…
The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem…
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$…
Offline reinforcement learning and offline inverse reinforcement learning aim to recover near-optimal value functions or reward models from a fixed batch of logged trajectories, yet current practice still struggles to enforce Bellman…
Given an array of distinct integers $A[1\ldots n]$, the Range Minimum Query (RMQ) problem requires us to construct a data structure from $A$, supporting the RMQ query: given an interval $[a,b]\subseteq[1,n]$, return the index of the minimum…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
We investigate the first order implicit linear difference equation over residue class rings modulo m. We prove an existence criterion and establish the amount of solutions for this equation. We obtain analogous results for the initial…
We study the size of nodal sets of Laplacian eigenfunctions on compact Riemannian manifolds without boundary and recover the currently optimal lower bound by comparing the heat flow of the eigenfunction with that of an artifically…
We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover,…
For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…
We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju \cite{GR2019a}. In particular, we show that any $n$-process RME algorithm using only atomic read, write,…
Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…
The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in \cite{q} and derive an…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
The problem of storing permutations in a distributed manner arises in several common scenarios, such as efficient updates of a large, encrypted, or compressed data set. This problem may be addressed in either a combinatorial or a coding…
We introduce and study minimal (with respect to inclusion) solutions of systems of tropical linear differential equations. We describe the set of all minimal solutions for a single equation. It is shown that any tropical linear differential…