English
Related papers

Related papers: Nested subclasses of the class of $\alpha$-selfdec…

200 papers

Let $\Lambda$ be a finite-dimensional $k$-algebra with $k$ algebraically closed. Bongartz has recently shown that the existence of an indecomposable $\Lambda$-module of length $n > 1$ implies that also indecomposable $\Lambda$-modules of…

Representation Theory · Mathematics 2015-03-13 Claus Michael Ringel

On the space $\mathcal{L}_{n+1}$ of unimodular lattices in $\mathbb{R}^{n+1}$, we consider the standard action of $a(t)=\mathrm{diag}(t^n,t^{-1},\ldots,t^{-1})\in \mathrm{SL}(n+1,\mathbb{R})$ for $t>1$. Let $M$ be a nondegenerate…

Dynamical Systems · Mathematics 2023-11-28 Nimish A. Shah , Pengyu Yang

We consider the Arveson-Douglas conjecture on the essential normality of homogeneous submodules corresponding to algebraic subvarieties of the unit ball. We prove that the property of essential normality is preserved by isomorphisms between…

Operator Algebras · Mathematics 2014-05-16 Matthew Kennedy , Orr Shalit

A new construction of decomposition smoothness spaces of homogeneous type is considered. The smoothness spaces are based on structured and flexible decompositions of the frequency space $\mathbb{R}^d\backslash\{0\}$. We construct simple…

Functional Analysis · Mathematics 2017-12-20 Zeineb Al-Jawahri , Morten Nielsen

Inspired by R. Speicher's multidimensional free central limit theorem and semicircle families, we prove an infinite dimensional compound Poisson limit theorem in free probability, and define infinite dimensional compound free Poisson…

Operator Algebras · Mathematics 2017-12-19 Guimei An , Mingchu Gao

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

Logic in Computer Science · Computer Science 2011-02-02 Wil Dekkers

Many properties of groups can be defined by the existence of a particular normal series. The classic examples being solvability, supersolvability and nilpotence. Among the nilpotent groups are the so-called nested GVZ-groups --- groups…

Group Theory · Mathematics 2019-07-11 Shawn T. Burkett , Mark L. Lewis

Hamkins and Kikuchi (2016 and 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. If $\mathcal{M}$ is a model of set theory, then $\langle M,…

Logic · Mathematics 2022-09-13 Zachiri McKenzie

A locally small category E is totally distributive (as defined by Rosebrugh-Wood) if there exists a string of adjoint functors t -| c -| y, where y : E --> E^ is the Yoneda embedding. Saying that E is lex totally distributive if, moreover,…

Category Theory · Mathematics 2012-10-22 Rory B. B. Lucyshyn-Wright

In this paper we describe a theory of a cumulative distribution function on a space with an order from a probability measure defined in this space. This distribution function plays a similar role to that played in the classical case.…

Probability · Mathematics 2019-04-12 J. F. Gálvez-Rodríguez , M. A. Sánchez-Granero

Extension of two known facts concerning subordination is made. The first fact is that, in subordination of 1-dimensional Brownian motion with drift, selfdecomposability is inherited from subordinator to subordinated. This is extended to…

Probability · Mathematics 2007-10-02 Ken-iti Sato

There are many applications that benefit from computing the exact divergence between 2 discrete probability measures, including machine learning. Unfortunately, in the absence of any assumptions on the structure or independencies within…

Machine Learning · Computer Science 2023-10-16 Loong Kuan Lee , Nico Piatkowski , François Petitjean , Geoffrey I. Webb

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

Logic · Mathematics 2017-11-21 Miloš S. Kurilić , Nenad Morača

It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability…

Quantum Physics · Physics 2015-10-14 Marek Mozrzymas , Adam Rutkowski , Michał Studziński

Let $\Lambda$ be the collection of all probability distributions for $(X,\widetilde{X})$, where $X$ is a fixed random vector and $\widetilde{X}$ ranges over all possible knockoff copies of $X$ (in the sense of \cite{CFJL18}). Three topics…

Statistics Theory · Mathematics 2022-08-01 Patrizia Berti , Emanuela Dreassi , Fabrizio Leisen , Luca Pratelli , Pietro Rigo

An automorphism on a complex supermanifold $\mathcal M$ is called unipotent if it reduces to the identity on the associated graded supermanifold $gr(\mathcal M)$. These automorphisms are close to be complementary to those responsible for…

Complex Variables · Mathematics 2016-07-26 Matthias Kalus

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

Artificial Intelligence · Computer Science 2013-02-08 Radim Jirousek

Given two monads $S$, $T$ on a category where idempotents split, and a weak distributive law between them, one can build a combined monad $U$. Making explicit what this monad $U$ is requires some effort. When we already have an idea what…

Logic in Computer Science · Computer Science 2025-11-04 Jean Goubault-Larrecq

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro