Related papers: On the axioms for a unique factorization domain
This paper is devoted to establish sufficient conditions under which a transcendental meromorphic function has no unbounded Fatou components and to extend some results for entire functions to meromorphic functions. Actually, we shall mainly…
A definition is offered of the factorial characters of the general linear group, the symplectic group and the orthogonal group in an odd dimensional space. It is shown that these characters satisfy certain flagged Jacobi-Trudi identities.…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…
The method of \emph{random integral representation}, that is, the method of representing a given probability measure as the probability distribution of some random integral, was quite successful in the past few decades. In this note we will…
We define a pair of simple combinatorial operations on subshifts, called existential and universal extensions, and study their basic properties. We prove that the existential extension of a sofic shift by another sofic shift is always…
Let $M$ be a cancellative commutative monoid and call a submonoid $S$ of $M$ an undermonoid if $\G(S)=\G(M)$ inside the Grothendieck group of $M$. Gotti and Li asked whether the finite factorization property is hereditary once it is known…
In this paper one finds:1) A simple combinatorical description of the distinguished boundary of the crown domain in terms of the affine Weyl group; 2) Optimal upper and lower bounds for holomorphically extended spherical functions; 3) First…
In the 1-dimensional matrix model one identifies the tachyon field in the asymptotic region with a nonlocal transform of the density of fermions. But there is a problem in relating the classical tachyon field with the surface profile of the…
We study algebraic and arithmetic properties of submonoids (resp. subrings) of factorial monoids (resp. factorial domains) whose non-invertible elements all lie in the conductor. This continues earlier work of Baeth, Cisto, et al.. On our…
Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…
Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…
Unsupervised domain adaptation (UDA) has attracted considerable attention, which transfers knowledge from a label-rich source domain to a related but unlabeled target domain. Reducing inter-domain differences has always been a crucial…
In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of…
We present the Unified Form Language (UFL), which is a domain-specific language for representing weak formulations of partial differential equations with a view to numerical approximation. Features of UFL include support for variational…
We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].
We remark on pseudo-elliptic integrals and on exceptional function fields, namely function fields defined over an infinite base field but nonetheless containing non-trivial units. Our emphasis is on some elementary criteria that must be…
As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…
The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…