Related papers: The method of the weakly conjugate operator: Exten…

In this paper, we introduce the weakly nilpotent hypergroups with giving some new properties, and then establish several structural characterizations of these hypergroups. Some results obtained in this paper answer the two questions raised…

We give several algorithms addressing computations of intersections of conjugate subgroups.

In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal…

We review recent probabilistic results on covariant Schr\"odinger operators on vector bundles over (possibly locally infinite) weighted graphs, and explain applications like semiclassical limits. We also clarify the relationship between…

This article aims to explore the most recent developments in the study of the Hilbert matrix, acting as an operator on spaces of analytic functions and sequence spaces. We present the latest advances in this area, aiming to provide a…

We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.

The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.

We study the space of vector-valued (twisted) conjugate invariant functions on a connected reductive group.

We survey some uses of adjoint functors in graph theory pertaining to colourings, complexity reductions, multiplicativity, circular colourings and tree duality. The exposition of these applications through adjoint functors unifies the…

In an abstract framework, a new concept on time operator, ultra-weak time operator, is introduced, which is a concept weaker than that of weak time operator. Theorems on the existence of an ultra-weak time operator are established. As an…

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…

In this paper, we introduce the classes of weakly surjunctive and linearly surjunctive groups which include all sofic groups and more generally all surjunctive groups. We investigate various properties of such groups and establish in…

We provide martingale analogs of weakly cancelling differential operators and prove a Sobolev-type embedding theorem for these operators in the martingale setting.

We prove quantitative factorization results for several classes of operators, including weakly compact, Rosenthal, and $\xi$-Banach-Saks operators.

For a sequence of uniformly bounded, degenerate semigroups on a Hilbert space, we compare various types of convergences to a limit semigroup. Among others, we show that convergence of the semigroups, or of the resolvents of the generators,…

We investigate the conjugate indicator diagram or, equivalently, the indicator function of (frequently) hypercyclic functions of exponential type for differential operators. This gives insights into growth conditions of these functions on…

This paper attempts to provide a more or less self-contained introduction into theory of the Grothendieck-Teichmueller group and Drinfeld associators using the theory of operads and graph complexes.

We develop sensitivity analyses for weak nulls in matched observational studies while allowing unit-level treatment effects to vary. The methods may be applied to studies using any optimal without-replacement matching algorithm. In contrast…

We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a weakly chordal graph on the n vertices) based on this tree.…