Related papers: The partial gossip problem revisited
This paper presents gossip algorithms for aggregation tasks that demonstrate both robustness to adversarial corruptions of any order of magnitude and optimality across a substantial range of these corruption levels. Gossip algorithms…
In this paper we present new, short and elementary proofs of the famous projection and section theorems that are used in Stochastic Calculus.
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their…
This is a technical report, containing all the theorem proofs and additional evaluations in paper "Monitor Placement for Maximal Identifiability in Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley,…
This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties,…
We provide a proof of a variant of the Landau-Siegel Zeros conjecture.
We give a short proof of a reverse isoperimetric inequality due to Y. Groman and J. P. Solomon.
Thanks to the test function of Bian-Guan[2], we successfully obtain a constant rank theorem for partial convex solutions of a class partial differential equations. This is the microscopic version of the macroscopic partial convexity…
We give a new, elementary proof of the celebrated Herzog-Hibi-Zheng theorem on powers of quadratic monomial ideals.
We prove an exact relationship between the optimal denoising function and the data distribution in the case of additive Gaussian noise, showing that denoising implicitly models the structure of data allowing it to be exploited in the…
We give a new proof of the Semistable Reduction Theorem for curves. The main idea is to present a curve $Y$ over a local field $K$ as a finite cover of the projective line $X=\PP^1_K$. By successive blowups (and after replacing $K$ by a…
A conjecture of Chunwei Song on a limiting case of the q,t-Schr\"{o}der theorem is proved combinatorially. The proof matches pairs of tableaux to Catalan words in a manner that preserves differences in the maj statistic.
The paper discusses the summability of formal solutions of some linear q-difference-differential equations, and improves the previous result in [Tahara-Yamazawa, Opsucula Math. 35 (2015), 713-738].
In this paper, we will give an improvement on the lower bound for the counterfeit coins problem in the case that the number of false coins is unknown in advance
The current work revisits the results of L.F. Meyers and R. See in [3], and presents the census-taker problem as a motivation to introduce the beautiful theory of numbers.
We consider for the first time a stochastic generalized Nash equilibrium problem, i.e., with expected-value cost functions and joint feasibility constraints, under partial-decision information, meaning that the agents communicate only with…
We prove two single-parameter q-supercongruences which were recently conjectured by Guo, and establish their further extensions with one more parameter. Crucial ingredients in the proof are the terminating form of q-binomial theorem and a…
What if the paradoxical nature of quantum theory could find its source in some undecidability analog to that of G\"odel's incompleteness theorem ? This essay aims at arguing for such G\"odelian hunch via two case studies. Firstly, using a…
We prove upper and lower bounds for the threshold of the q-overlap-k-Exact cover problem. These results are motivated by the one-step replica symmetry breaking approach of Statistical Physics, and the hope of using an approach based on that…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…