相关论文: Statistically characterized subgroups related to s…
Very recently, in [Das et al., J. Lond. Math. Soc., 2025], statistically characterized subgroups were studied for certain classes of non-arithmetic sequences. Subsequently, in [Das et al., Bull. Sci. Math., 2025], characterized subgroups…
Recently, in Das et al. (Mediterr. J. Math. 21 : 164, 2024), characterized subgroups are investigated for some special kind of non-arithmetic sequences. In this note, we study subsequent problems in case of ``statistically characterized…
In a recent work [Das et al., Bull. Sci. Math. 199 (2025), 103580], the structure of characterized subgroups corresponding to arithmetic-type sequences was investigated. Building upon this work, we further show that a characterized subgroup…
In this note, we continue the investigation of the new version of characterized subgroups of the circle group $\mathbb{T}$, namely, "statistically characterized subgroups" (shortly, "s-characterized subgroups") recently introduced in…
P. Das, A. Ghosh and T. Aziz has given in \cite[Theorem 3.15]{ADG} a result on statistically characterized subgroups of the circle group $\mathbb{R}/\mathbb{Z}$, which answers, together with \cite[Corollary 2.4]{DG24}, questions of…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…
Let $k$ be an algebraically closed field of characteristic $p>0$ and let $C/k$ be a smooth connected affine curve. Denote by $\pi_1(C)$ its algebraic fundamental group. The goal of this paper is to characterize a certain subset of closed…
The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…
Statistical convergence was introduced in connection with problems of series summation. The main idea of the statistical convergence of a sequence l is that the majority of elements from l converge and we do not care what is going on with…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
Every conditionally convergent series of real numbers has a subseries that diverges. The subseries numbers, previously studied in arXiv:1801.06206 , answer the question how many subsets of the natural numbers are necessary, such that every…
A subgroup $H$ of a topological abelian group $X$ is said to be characterized by a sequence $\mathbf v =(v_n)$ of characters of $X$ if $H=\{x\in X:v_n(x)\to 0\ \text{in}\ \mathbb T\}$. We study the basic properties of characterized…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…
This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to…
Let $\mathscr{X}$ be the set of positive real sequences $x=(x_n)$ such that the series $\sum_n x_n$ is divergent. For each $x \in \mathscr{X}$, let $\mathcal{I}_x$ be the collection of all $A\subseteq \mathbf{N}$ such that the subseries…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
Statistical sufficiency formalizes the notion of data reduction. In the decision theoretic interpretation, once a model is chosen all inferences should be based on a sufficient statistic. However, suppose we start with a set of procedures…