English
Related papers

Related papers: Phantom depth and stable phantom exactness

200 papers

An analogue of the theory of integral closure and reductions is developed for a more general class of closures, called Nakayama closures. It is shown that tight closure is a Nakayama closure by proving a ``Nakayama lemma for tight…

Commutative Algebra · Mathematics 2007-05-23 Neil Epstein

We prove that if $f: (R,\m) \to (S,\n)$ is a flat local homomorphism, $S/\m S$ is Cohen-Macaulay and $F$-injective, and $R$ and $S$ share a weak test element, then a tight closure analogue of the (standard) formula for depth and regular…

Commutative Algebra · Mathematics 2010-02-26 Neil M. Epstein

We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…

Category Theory · Mathematics 2011-11-03 Jawad Abuhlail

We study families of depth measures defined by natural sets of axioms. We show that any such depth measure is a constant factor approximation of Tukey depth. We further investigate the dimensions of depth regions, showing that the Cascade…

Combinatorics · Mathematics 2022-08-11 Patrick Schnider

In this article, we generalize a previously defined set of axioms for a closure operation that induces balanced big Cohen-Macaulay modules. While the original axioms were only defined in terms of finitely generated modules, these new ones…

Commutative Algebra · Mathematics 2018-02-01 Geoffrey D. Dietz

We introduce an operation on modules over an $F$-finite ring of characteristic $p$. We call this operation \emph{tight interior}. While it exists more generally, in some cases this operation is equivalent to the Matlis dual of tight…

Commutative Algebra · Mathematics 2015-01-14 Neil Epstein , Karl Schwede

In this article, we investigate the existence of accelerating scaling solutions in coupled phantom cosmology without assuming any specific potential for the phantom scalar field. The coupling between phantom dark energy and dark matter is…

General Relativity and Quantum Cosmology · Physics 2026-02-11 Sudip Halder , Supriya Pan , Paulo M. Sá , Tapan Saha

The strength of machine learning models stems from their ability to learn complex function approximations from data; however, this strength also makes training deep neural networks challenging. Notably, the complex models tend to memorize…

Computer Vision and Pattern Recognition · Computer Science 2023-04-17 Mofassir ul Islam Arif , Mohsan Jameel , Josif Grabocka , Lars Schmidt-Thieme

The thermodynamic properties of a phantom fluid and accretion by a black hole were recently revisited by Pereira (2008) and Lima et al. (2008). In order to keep positive both the entropy and the temperature, those authors assumed that the…

Astrophysics · Physics 2008-08-14 J. A. de Freitas Pacheco

We present a unified treatment of the phase space of a spatially flat homogeneous and isotropic universe dominated by a phantom field. Results on the dynamics and the late time attractors (Big Rip, de Sitter, etc.) are derived without…

General Relativity and Quantum Cosmology · Physics 2009-11-11 Valerio Faraoni

Random transformations are typically good at "scrambling" information. Specifically, in the quantum setting, scrambling usually refers to the process of mapping most initial pure product states under a unitary transformation to states which…

Quantum Physics · Physics 2013-07-04 Winton Brown , Omar Fawzi

We provide a negative answer to an old question in tight closure theory by showing that the containment x^3y^3 \in (x^4,y^4,z^4)^* in K[x,y,z]/(x^7+y^7-z^7) holds for infinitely many but not for almost all prime characteristics of the field…

Commutative Algebra · Mathematics 2007-05-23 Holger Brenner , Mordechai Katzman

We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…

Data Structures and Algorithms · Computer Science 2024-03-27 Shengminjie Chen , Donglei Du , Wenguo Yang , Dachuan Xu , Suixiang Gao

We expand the notion of core to $cl$-core for Nakayama closures $cl$. In the characteristic $p>0$ setting, when $cl$ is the tight closure, denoted by *, we give some examples of ideals when the core and the *-core differ. We note that…

Commutative Algebra · Mathematics 2010-09-20 Louiza Fouli , Janet Vassilev

In this note, we revisit the problem of flow approximation properties of neural ordinary differential equations (NODEs). The approximation properties have been considered as a flow controllability problem in recent literature. The neural…

Optimization and Control · Mathematics 2025-03-07 Karthik Elamvazhuthi

For a reduced Noetherian ring $R$ of characteristic $p > 0$, in this paper we discuss an extension of $R$ called its perfect closure $R^\infty$. This extension contains all $p^e$-th roots of elements of $R$, and is usually non-Noetherian.…

Commutative Algebra · Mathematics 2018-10-22 George Whelan

We look at how the equivalence of tight closure and plus closure (or Frobenius closure) in the homogeneous m-coprimary case implies the same closure equivalence in the non-homogeneous m-coprimary case in standard graded rings. Although our…

Commutative Algebra · Mathematics 2007-05-23 Geoffrey D. Dietz

Learning depth from a single image, as an important issue in scene understanding, has attracted a lot of attention in the past decade. The accuracy of the depth estimation has been improved from conditional Markov random fields,…

Computer Vision and Pattern Recognition · Computer Science 2018-08-01 Lei He , Guanghui Wang , Zhanyi Hu

This paper investigates the soft covering lemma under both the relative entropy and the total variation distance as the measures of deviation. The exact order of the expected deviation of the random i.i.d. code for the soft covering problem…

Information Theory · Computer Science 2019-02-22 Mohammad Hossein Yassaee

Diagram-chasing arguments frequently lead to "magical" relations between distant points of diagrams: exactness implications, connecting morphisms, etc.. These long connections are usually composites of short "unmagical" connections, but the…

Category Theory · Mathematics 2013-05-10 George M. Bergman
‹ Prev 1 2 3 10 Next ›