Related papers: Associative idempotent nondecreasing functions are…
Suppose that $G$ is a finite group and $H$ is a nilpotent subgroup of $G$. If a character of $H$ induces an irreducible character of $G$, then the generalized Fitting subgroup of $G$ is nilpotent.
I study the problem of renormalizing a non-renormalizable theory with a reduced, eventually finite, set of independent couplings. The idea is to look for special relations that express the coefficients of the irrelevant terms as unique…
In this paper, we introduce the integration of algebroidal functions on Riemann surfaces for the first time. Some properties of integration are obtained. By giving the definition of residues and integral function element, we obtain the…
Similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
In this paper, some sufficient conditions for the differentiability of the $n$-variable real-valued function are obtained, which are given based on the differentiability of the $n-1$-variable real-valued function and are weaker than…
Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…
An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…
``Fusion rules'' are laws of multiplication among eigenspaces of an idempotent. We establish fusion rules for flexible power-associative algebras, following Albert. We define the notion of an axis in the noncommutative setting (compare with…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
Let $S$ be a subset of a amenable group $G$ such that $e\in S$ and $S^{-1}=S$. The main result of the paper states that if the Cayley graph of $G$ with respect to $S$ has a certain combinatorial property, then every positive definite…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…
In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
A new derivative, called deformable derivative, is introduced here which is equivalent to ordinary derivative in the sense that one implies other. The deformable derivative is defined using limit approach like that of ordinary one but with…
This is the English translation of my old paper 'Definici\'on y estudio de una funci\'on indefinidamente diferenciable de soporte compacto', Rev. Real Acad. Ciencias 76 (1982) 21-38. In it a function (essentially Fabius function) is defined…
The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…