Related papers: Almost associative operations generating a minimal…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
We discuss the feasibility of the following learning problem: given unmatched samples from two domains and nothing else, learn a mapping between the two, which preserves semantics. Due to the lack of paired samples and without any…
Usually, density functional models are considered approximations to density functional theory, However, there is no systematic connection between the two, and this can make us doubt about a linkage. This attitude can be further enforced by…
It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
The paper studies semi-almost periodic holomorphic functions on a polydisk which have, in a sense, the weakest possible discontinuities on the boundary torus. The basic result used in the proofs is an extension of the classical Bohr…
We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations…
Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
It is known that there are Lie algebras with non-semigroup gradings, i.e. such that the binary operation on the grading set is not associative. We provide a similar example in the class of associative algebras.
The nilpotency degree of a relatively free finitely generated associative algebra with the identity $x^n=0$ is studied over finite fields.
Relations between discrete quantities such as people, genes, or streets can be described by networks, which consist of nodes that are connected by edges. Network analysis aims to identify important nodes in a network and to uncover…
Association rules express implication formed relations among attributes in databases of itemsets. The apriori algorithm is presented, the basis for most association rule mining algorithms. It works by pruning away rules that need not be…
We show an operational approach to bilocality with quasi-probability distributions and quasi-stochastic processes. This approach clearly demonstrates that negative probabilities are necessary to violate bilocality. It also highlights a…
Processes with almost periodic covariance functions have spectral mass on lines parallel to the diagonal in the two-dimensional spectral plane. Methods have been given for estimation of spectral mass on the lines of spectral concentration…
The notion of almost symmetric numerical semigroup was given by V. Barucci and R. Fr\"oberg. We characterize almost symmetric numerical semigroups by symmetry of pseudo-Frobenius numbers. We give a criterion for $H^*$ (the dual of $M$) to…
Semantic equivalences are used in process algebra to capture the notion of similar behaviour, and this paper proposes a semi-quantitative equivalence for a stochastic process algebra developed for biological modelling. We consider…
The trade-offs among various output fidelities of asymmetric universal cloning machines are investigated. First we find out all the attainable optimal output fidelities for the 1 to 3 asymmetric universal cloning machine and it turns out…
We investigate near-ring properties that generalize nearfield properties about units. We study zero symmetric near-rings $N$ with identity with two interrelated properties: the units with zero form an additive subgroup of $(N,+)$; the units…