Results 31 to 40 of about 46,964 (266)

Stacks of cyclic covers of projective spaces

open access: yes, 2003
We define stacks of uniform cyclic covers of Brauer-Severi schemes, proving that they can be realized as quotient stacks of open subsets of representations, and compute the Picard group for the open substacks parametrizing smooth uniform cyclic covers ...
Arsie, Alessandro, Vistoli, Angelo
core   +2 more sources

On covers of cyclic acts over monoids

open access: yes, 2008
In (Bull. Lond. Math. Soc. 33:385–390, 2001) Bican, Bashir and Enochs finally solved a long standing conjecture in module theory that all modules over a unitary ring have a flat cover.
B. Stenström   +14 more
core   +1 more source

Categorical Properties of Soft Sets

open access: yesThe Scientific World Journal, 2014
The present study investigates some novel categorical properties of soft sets. By combining categorical theory with soft set theory, a categorical framework of soft set theory is established.
Min Zhou, Shenggang Li, Muhammad Akram
doaj   +1 more source

ORTHORECTIFICATION BY USING GPGPU METHOD [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012
Thanks to the nature of the graphics processing, the newly released products offer highly parallel processing units with high-memory bandwidth and computational power of more than teraflops per second.
H. Sahin, S. Kulur
doaj   +1 more source

Classes of modules closed under projective covers

open access: yesOpen Mathematics
In this work, we study some classes of modules closed under submodules, quotients, and projective covers, even if the left projective cover of an arbitrary left module not always exists. We obtain a characterization of artinian principal ideal rings when
Cejudo-Castilla César   +2 more
doaj   +1 more source

Constructing Permutation Rational Functions From Isogenies

open access: yes, 2017
A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$.
Bisson, Gaetan, Tibouchi, Mehdi
core   +3 more sources

Quasi-Projective Covers and Direct Sums [PDF]

open access: yesProceedings of the American Mathematical Society, 1970
In this paper R R denotes an associative ring with an identity, and all modules are unital left R R -modules. It is shown that the existence of a quasi-projective cover for each module implies that each module has a projective cover. By a similar technique the following statements are shown to be equivalent: 1.
openaire   +2 more sources

An upstream open reading frame regulates expression of the mitochondrial protein Slm35 and mitophagy flux

open access: yesFEBS Letters, EarlyView.
This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva   +5 more
wiley   +1 more source

Cosets, characters and fusion for admissible-level osp(1|2) minimal models

open access: yesNuclear Physics B, 2019
We study the minimal models associated to osp(1|2), otherwise known as the fractional-level Wess–Zumino–Witten models of osp(1|2). Since these minimal models are extensions of the tensor product of certain Virasoro and sl2 minimal models, we can induce ...
Thomas Creutzig   +3 more
doaj   +1 more source

Projections of random covering sets [PDF]

open access: yesJournal of Fractal Geometry, Mathematics of Fractals and Related Topics, 2015
We show that, almost surely, the Hausdor dimension s0 of a random covering set is preserved under all orthogonal projections to linear subspaces with dimension k > s_0 . The result holds for random covering sets with a generating sequence of ball-
Chen, Changhao   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy