Related papers: Localization of unique factorization semidomains
Nonnegative matrix factorization (NMF) is a popular dimension reduction technique that produces interpretable decomposition of the data into parts. However, this decompostion is not generally identifiable (even up to permutation and…
We model the underdoped cuprates using fermions moving in a background with local antiferromagnetic order. The antiferromagnetic order fluctuates in orientation, but not in magnitude, so that there is no long-range antiferromagnetism, but a…
Domain adaptation is a critical task in machine learning that aims to improve model performance on a target domain by leveraging knowledge from a related source domain. In this work, we introduce Universal Semi-Supervised Domain Adaptation…
A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…
In this article we study the basic theoretical properties of Mellin-type fractional integrals, known as generalizations of the Hadamard-type fractional integrals. We give a new approach and version, specifying their semigroup property,…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
An integral domain $D$ is called an irreducible-divisor-finite domain (IDF-domain) if every nonzero element of $D$ has finitely many irreducible divisors up to associates. The study of IDF-domains dates back to the seventies. In this paper,…
We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.
We discuss the large $N$ factorization properties of five-dimensional supersymmetric partition functions for CFT with a holographic dual. We consider partition functions on manifolds of the form $\mathcal{M}= \mathcal{M}_3 \times…
We present an Anderson-type model Hamiltonian with exchange coupling between the localized spins and the confined holes in the quantum dots to study the ferromagnetism in diluted magnetic semiconductor (DMS) quantum dot arrays embedded in…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
We consider normalizers of an irreducible inclusion $N\subseteq M$ of $\mathrm{II}_1$ factors. In the infinite index setting an inclusion $uNu^*\subseteq N$ can be strict, forcing us to also investigate the semigroup of one-sided…
Let $D$ be a principal ideal domain and $R(D) = \{\begin{pmatrix} a & b 0 & a \end{pmatrix} \mid a, b \in D\}$ be its self-idealization. It is known that $R(D)$ is a commutative noetherian ring with identity, and hence $R(D)$ is atomic…
Gaussian processes are widely used for the analysis of spatial data due to their nonparametric flexibility and ability to quantify uncertainty, and recently developed scalable approximations have facilitated application to massive datasets.…
Quasiperiodic systems serve as fertile ground for studying localisation, due to their propensity already in one dimension to exhibit rich phase diagrams with mobility edges. The deterministic and strongly-correlated nature of the…
Deep learning for supervised learning has achieved astonishing performance in various machine learning applications. However, annotated data is expensive and rare. In practice, only a small portion of data samples are annotated.…
Consistency regularization describes a class of approaches that have yielded ground breaking results in semi-supervised classification problems. Prior work has established the cluster assumption - under which the data distribution consists…
Let $(X,\bullet )$ be a groupoid (binary algebra) and $Bin(X\dot{)}$ denote the collection of all groupoids defined on $X$. We introduce two methods of factorization for this binary system under the binary groupoid product \textquotedblleft…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
We extend some results of [BF12] on subfactor projections to show that the projection of a free factor B to the free factor complex of the free factor A is well-defined with uniformly bound diameter, unless either A is contained in B or A…