Related papers: James' weak compactness theorem: an exposition

In 2015, Archdeacon proposed the notion of Heffter arrays in view of its connection to several other combinatorial objects. In the same paper he also presented the following variant. A weak Heffter array $\mathrm{W}\mathrm{H}(m,n;h,k)$ is…

This work extends the idea of matched pairs presented by Majid in \cite{Majid} and Takeuchi in \cite{Takeuchi} for the context of weak bialgebras and weak Hopf algebras. We introduce, also inspired by partial matched pairs…

The Banach space $E$ has the weakly compact approximation property (W.A.P. for short) if there is a constant $C < \infty$ so that for any weakly compact set $D \subset E$ and $\epsilon > 0$ there is a weakly compact operator $V: E \to E$…

In this paper, we prove convergence in distribution of Langevin processes in the overdamped asymptotics. The proof relies on the classical perturbed test function (or corrector) method, which is used both to show tightness in path space,…

We present elementary proofs of weighted embedding theorems for radial potential spaces and some generalizations of Ni's and Strauss' inequalities in this setting.

We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of…

A close look at students' written work on examinations offers a wealth of information about their performance, their knowledge of the subject, their strengths, weaknesses and misconceptions, and their overall level of mathematical skills…

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

This paper introduces the construction of a weakly globular double category of fractions for a category and studies its universal properties. It shows that this double category is locally small and considers a couple of concrete examples.

There is a rich theory of existence theorems for minimizers over reflexive Sobolev spaces (ex. Eberlein-\v{S}mulian theorem). However, the existence theorems for many variational problems over non-reflexive Sobolev spaces remain…

We prove collective versions of semi-duality theorems for sets of almost (limitedly, order) L-weakly compact operators.

A general approach to the measurement of an observable with pre- and post-selection is presented. The limit of weak measurement is studied in detail, and it is shown that the phase of the probe, including a Hamiltonian contribution to it,…

In this paper, it is shown that a weakly non-decreasable dilatation in an infinitesimal Teichm\"uller equivalence class can be not a non-decreasable one. As an application, we prove that if an infinitesimal equivalence class contains more…

In this paper, Jack lemma is used for obtaining several differential inequalities over analytic functions that later on, lead to new criteria for univalency in the unit disk.

Since its introduction 25 years ago, the quantum weak value has gradually transitioned from a theoretical curiosity to a practical laboratory tool. While its utility is apparent in the recent explosion of weak value experiments, its…

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…

In this paper, we study the continuity of expected utility functions, and derive a necessary and sufficient condition for a weak order on the space of simple probabilities to have a continuous expected utility function. We also verify that…

The weak regular coherence is a coarse property of a finitely generated group $\Gamma$. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen's regular coherence as part of computation of the…

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…