We prove the vanishing of the bounded cohomology of lamplighter groups for a wide range of coefficients. This implies the same vanishing for a number of groups with self-similarity properties, such as Thompson's group F. In particular, these groups are bou ...
The objective of this series is to study metric geometric properties of disjoint unions of Cayley graphs of amenable groups by group properties of the Cayley accumulation points in the space of marked groups. In this Part II, we prove that a disjoint union ...
We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...
In this paper we consider the Holm-Staley b-family of equations in the Sobolev spaces H-s (R) for s > 3/2. Using a geometric approach we show that, for any value of the parameter b, the corresponding solution map, u(0) bar right arrow u(T), is nowhere loca ...
We prove the Kawamata-Viehweg vanishing theorem for surfaces of del Pezzo type over perfect fields of positive characteristic p > 5. As a consequence, we show that klt threefold singularities over a perfect base field of characteristic p > 5 are rational. ...
Semi-Lagrangian (SL) schemes are of utmost relevance to simulate two-phase flows where advection dominates. The combination of SL schemes with the finite element (FE) method and arbitrary Lagrangian-Eulerian (ALE) dynamic meshes yields a strong ingredient ...
Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...
The subconvexity problem aims at providing non-trivial (i.e. subconvex) bounds for central values of automorphic L-functions; the main conjecture in this area is the Generalized Lindelof Hypothesis which itself is a consequence of the Generalized Riemann H ...
This paper presents a web application for visualizing the tonality of a piece of music-the organization of its chords and scales-at a high level of abstraction and with coordinated playback. The application applies the discrete Fourier transform to the pit ...
Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...
Conjugation spaces are equipped with an involution such that the fixed points have the same mod 2 cohomology (as a graded vector space, a ring, and even an unstable algebra) but with all degrees divided by 2, generalizing the classical examples of complex ...
Many research questions involve time-to-event outcomes that can be prevented from occurring due to competing events. In these settings, we must be careful about the causal interpretation of classical statistical estimands. In particular, estimands on the h ...
Motivation: The majority of genome analysis tools and pipelines require data to be decrypted for access. This potentially leaves sensitive genetic data exposed, either because the unencrypted data is not removed after analysis, or because the data leaves t ...
This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations tha ...
While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of 2 for the unweighted matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted instances. Their approach is ...
We consider the problem of non-negative super-resolution, which concerns reconstructing a non-negative signal x = Sigma(k )(i=1)a(i)delta(ti) from m samples of its convolution with a window function phi(s - t), of the form y(s(j)) = Sigma(k)(i=1) a(i) phi( ...
In order to simulate the cardiac function for a patient-specific geometry, the generation of the computational mesh is crucially important. In practice, the input is typically a set of unprocessed polygonal surfaces coming either from a template geometry o ...
We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...
Individual performance metrics are commonly used to compare players from different eras. However, such cross-era comparison is often biased due to significant changes in success factors underlying player achievement rates (e.g. performance enhancing drugs ...
