Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Samuel Zbarsky"'
Autor:
Samuel Zbarsky, John W. Anderson
Publikováno v:
International Mathematics Research Notices. 2023:95-184
In this paper, we study the stability and instability of plane wave solutions to semilinear systems of wave equations satisfying the null condition. We identify a condition that allows us to prove the global nonlinear asymptotic stability of the plan
Autor:
Samuel Zbarsky
Publikováno v:
The Journal of Geometric Analysis. 31:817-824
For all $$p>1$$ and all centrally symmetric convex bodies, $$K\subset {\mathbb {R}}^d$$ defined Mf as the centered maximal function associated to K. We show that when $$d=1$$ or $$d=2$$ , we have $$||Mf||_p\ge (1+\epsilon (p,K))||f||_p$$ . For $$d\ge
Autor:
Ian Tice, Samuel Zbarsky
Publikováno v:
Journal of Mathematical Fluid Mechanics. 22
In this paper we consider a slab of viscous incompressible fluid bounded above by a free boundary, bounded below by a flat rigid interface, and acted on by gravity. The unique equilibrium is a flat slab of quiescent fluid. It is well-known that equil
Publikováno v:
IEEE Transactions on Information Theory. 64:3403-3410
We consider the problem of constructing binary codes to recover from $k$-bit deletions with efficient encoding/decoding, for a fixed $k$. The single deletion case is well understood, with the Varshamov-Tenengolts-Levenshtein code from 1965 giving an
Publikováno v:
Operations Research. 65:1078-1094
Redundancy is an important strategy for reducing response time in multi-server distributed queueing systems. This strategy has been used in a variety of settings, but only recently have researchers begun analytical studies. The idea behind redundancy
Autor:
Kristen Gardner, Alan Scheller-Wolf, Mor Harchol-Balter, Samuel Zbarsky, Sherwin Doroudi, Esa Hyytiä
Publikováno v:
Queueing Systems. 83:227-259
Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However, there is no exact
Autor:
Samuel Zbarsky
The main result is that given a generic self-similarly expanding configuration of 3 point vortices that start sufficiently far out, we can instead take compactly supported vorticity functions, and the resulting solution to 2D incompressible Euler wil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8ced52087ff70c1806b14d3ee827250
Autor:
Samuel Zbarsky
Publikováno v:
Discrete Mathematics. 338:1649-1658
We look at the rank generating function $G_\lambda$ of partitions inside the Ferrers diagram of some partition $\lambda$, investigated by Stanton in 1990, as well as a closely related problem investigated by Stanley and Zanello in 2013. We show that
Autor:
Samuel Zbarsky, Paata Ivanisvili
For 1 p ∞ and M the centered Hardy–Littlewood maximal operator on R , we consider whether there is some e = e ( p ) > 0 such that | | M f | | p ≥ ( 1 + e ) | | f | | p . We prove this for 1 p 2 . For 2 ≤ p ∞ , we prove the inequality for in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5a574d90b093d974bc1059188dae4e2
Publikováno v:
SIGMETRICS
Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However there is no exact a