Related papers: A Study on Filter Version of Strongly Central Sets

We give a new categorical way to construct the central stability homology of Putman and Sam and explain how it can be used in the context of representation stability and homological stability. In contrast to them, we cover categories with…

We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…

The concept of wave front set was introduced in 1969-1970 by M. Sato in the hyperfunctions context and by L. H\"ormander in the $\mathcal C^{\infty}$ context. Howe used the theory of wave front sets in the study of Lie groups…

Let A be a standard graded Artinian algebra over a field of characteristic zero and let z be a linear form in A. We define the central simple modules for each such pair (A, z). Assume that A is Gorenstein. Then we prove that A has the…

We prove a new weak mean ergodic theorem (Theorem A) for 1-cocycles associated to weakly mixing representations of amenable groups. Let $G$ be a finitely generated, discrete, amenable group $G$ which admits a controlled Folner sequence. We…

This notes are additional remarks to an article of Broussous and Stevens [arXiv:math/0402228v1]. We consider a unitary group G over a non-Archimedean local field k_0 of residue characteristic different from two and an element \beta\ of the…

In image classification, it is common practice to train deep networks to extract a single feature vector per input image. Few-shot classification methods also mostly follow this trend. In this work, we depart from this established direction…

We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…

In a Hilbert framework, we introduce continuous and discrete dynamical systems which aim at solving inclusions governed by structured monotone operators $A=\partial\Phi+B$, where $\partial\Phi$ is the subdifferential of a convex lower…

Finite W-algebras are certain associative algebras arising in Lie theory. Each W-algebra is constructed from a pair of a semisimple Lie algebra g (our base field is algebraically closed and of characteristic 0) and its nilpotent element e.…

Asymptotic uniform upper density, shortened as a.u.u.d., or simply upper density, is a classical notion which was first introduced by Kahane for sequences in the real line. Syndetic sets were defined by Gottschalk and Hendlund. For a…

In graph-based applications, a common task is to pinpoint the most important or ``central'' vertex in a (directed or undirected) graph, or rank the vertices of a graph according to their importance. To this end, a plethora of so-called…

We consider $C^1$ dynamical systems having an attracting hyperbolic fixed point or periodic orbit and prove existence and uniqueness results for $C^k$ (actually $C^{k,\alpha}_{\text{loc}}$) linearizing semiconjugacies -- of which Koopman…

The cluster soft point is an attempt to introduce a novel generalization of the soft closure point and the soft limit point. A cluster soft set is defined to be the system of all cluster soft points of a soft set. Then the fundamental…

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…

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…

We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…

Cluster analysis which focuses on the grouping and categorization of similar elements is widely used in various fields of research. Inspired by the phenomenon of atomic fission, a novel density-based clustering algorithm is proposed in this…

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…