Related papers: Approximations of Maximal and Principal Ideal
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
Rough set theory is a well-known mathematical framework that can deal with inconsistent data by providing lower and upper approximations of concepts. A prominent property of these approximations is their granular representation: that is,…
The ideal of the arc scheme of a double point or, equivalently, the differential ideal generated by the ideal of a double point is a primary ideal in an infinite-dimensional polynomial ring supported at the origin. This ideal has a rich…
It is proved that the ring $R$ with center $Z(R)$, such that the module $R_{Z(R)}$ is an essential extension of the module $Z(R)_{Z(R)}$, is not necessarily right quasi-invariant, i.e., maximal right ideals of the ring $R$ are not…
We study approximation and statistical learning properties of deep ReLU networks under structural assumptions that mitigate the curse of dimensionality. We prove minimax-optimal uniform approximation rates for $s$-H\"older smooth functions…
We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…
The notion off-ideals is recent and has been studied in the papers[1] [2], [5], [10], [11], [12], [13], [14] and [15]. In this paper, we have generalized the idea off-ideals to quasi f-ideals. This extended class of ideals is much bigger…
We study the existence of maximal ideals in preadditive categories defining an order $\preceq$ between objects, in such a way that if there do not exist maximal objects with respect to $\preceq$, then there is no maximal ideal in the…
In this note, we define and investigate ideal covering numbers of associative rings (not assumed to be commutative or unital): three invariants defined as the minimal number of proper left, right, or two-sided ideals whose union equals the…
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…
The peak algebra is a unital subalgebra of the symmetric group algebra, linearly spanned by sums of permutations with a common set of peaks. By exploiting the combinatorics of sparse subsets of [n-1] (and of certain classes of compositions…
In this work we introduce a new concept, namely, $\tau_{s}$-extending modules (rings) which is torsion-theoretic analogues of extending modules and then we extend many results from extending modules to this new concept. For instance we show…
In his proof of Fermat's Last Theorem, Wiles deployed a commutative algebra technique, namely a numerical criterion for detecting isomorphisms of rings. In our recent work we pick up on Wiles' work and generalize the numerical criterion to…
This paper develops fundamental limits of deep neural network learning by characterizing what is possible if no constraints are imposed on the learning algorithm and on the amount of training data. Concretely, we consider Kolmogorov-optimal…
We develop a maximum relative entropy formalism to generate optimal approximations to probability distributions. The central results consist in (a) justifying the use of relative entropy as the uniquely natural criterion to select a…
In this paper, we establish universal approximation theorems for neural networks applied to general nonlinear ill-posed operator equations. In addition to the approximation error, the measurement error is also taken into account in our…
The concept of hypergroup is generalization of group, first was introduced by Marty [9]. This theory had applications to several domains. Marty had applied them to groups, algebraic functions and rational functions. M. Krasner has studied…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
Here we have studied the notion of rough $I$-convergence as an extension of the idea of rough convergence in a cone metric space using ideals. We have further introduced the notion of rough $I^*$-convergence of sequences in a cone metric…
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…