Search results for " computation"
showing 10 items of 1478 documents
Geometric factors in the adiabatic evolution of classical systems
1992
Abstract The adiabatic evolution of the classical time-dependent generalized harmonic oscillator in one dimension is analyzed in detail. In particular, we define the adiabatic approximation, obtain a new derivation of Hannay's angle requiring no averaging principle and point out the existence of a geometric factor accompanying changes in the adiabatic invariant.
Confined But-2-ene catalytic isomerization inside H-ZSM-5 models: A DFT study
2015
The isomerization of cis-but-2-ene to trans-but-2-ene within a 22T H-ZSM-5 zeolite model, also in the presence of two adsorbed Pd atoms, has been studied by DFT calculations. The results obtained allow us to state that the cis/trans but-2-ene isomerization can easily proceed inside unsupported zeolite cavities. In this case, differently than in the gas phase reaction, the trans-but-2-ene is less stable than the cis-but-2-ene, when adsorbed on the zeolite inner surface. Excluding the adsorption-desorption steps, the isomerization process involves two intermediates and three transition states, whose energy content is always very low with respect to that of reagents and intermediate species. T…
Relation between fixation disparity and the asymmetry between convergent and divergent disparity step responses
2007
Abstract The neural network model of Patel et al. [Patel, S. S., Jiang, B. C., & Ogmen, H. (2001). Vergence dynamics predict fixation disparity. Neural Computation, 13 (7), 1495–1525] predicts that fixation disparity, the vergence error for a stationary fusion stimulus, is the result of asymmetrical dynamic properties of disparity vergence mechanisms: faster (slower) convergent than divergent responses give rise to an eso (exo) fixation disparity, i.e., over-convergence (under-convergence) in stationary fixation. This hypothesis was tested in the present study with an inter-individual approach: in 16 subjects we estimated the vergence step response to a 1 deg disparity stimulus with a subje…
Additivity of affine designs
2020
We show that any affine block design $$\mathcal{D}=(\mathcal{P},\mathcal{B})$$ is a subset of a suitable commutative group $${\mathfrak {G}}_\mathcal{D},$$ with the property that a k-subset of $$\mathcal{P}$$ is a block of $$\mathcal{D}$$ if and only if its k elements sum up to zero. As a consequence, the group of automorphisms of any affine design $$\mathcal{D}$$ is the group of automorphisms of $${\mathfrak {G}}_\mathcal{D}$$ that leave $$\mathcal P$$ invariant. Whenever k is a prime p, $${\mathfrak {G}}_\mathcal{D}$$ is an elementary abelian p-group.
Symmetric and asymmetric cryptographic key exchange protocols in the octonion algebra
2019
AbstractWe propose three cryptographic key exchange protocols in the octonion algebra. Using the totient function, defined for integral octonions, we generalize the RSA public-key cryptosystem to the octonion arithmetics. The two proposed symmetric cryptographic key exchange protocols are based on the automorphism and the derivation of the octonion algebra.
Finitary shadows of compact subgroups of $$S(\omega )$$
2020
AbstractLet LF be the lattice of all subgroups of the group $$SF(\omega )$$SF(ω) of all finitary permutations of the set of natural numbers. We consider subgroups of $$SF(\omega )$$SF(ω) of the form $$C\cap SF(\omega )$$C∩SF(ω), where C is a compact subgroup of the group of all permutations. In particular, we study their distribution among elements of LF. We measure this using natural relations of orthogonality and almost containedness. We also study complexity of the corresponding families of compact subgroups of $$S(\omega )$$S(ω).
Rationalizability of square roots
2021
Abstract Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a solution in terms of these functions is to rationalize all occurring square roots by a suitable variable change. In this paper, we give a rigorous definition of rationalizability for square roots of ratios of polynomials. We show that the problem of deciding whether a single square root is rationalizable can be reformulated in geometrical terms. Using this approach, we give easy criteria to decide rationalizability in most cases of square roots i…
A note on cocharacter sequence of Jordan upper triangular matrix algebra
2016
Let UJn(F) be the Jordan algebra of n × n upper triangular matrices over a field F of characteristic zero. This paper is devoted to the study of polynomial identities satisfied by UJ2(F) and UJ3(F). In particular, the goal is twofold. On one hand, we complete the description of G-graded polynomial identities of UJ2(F), where G is a finite abelian group. On the other hand, we compute the Gelfand–Kirillov dimension of the relatively free algebra of UJ2(F) and we give a bound for the Gelfand–Kirillov dimension of the relatively free algebra of UJ3(F).
The diamond partial order for strong Rickart rings
2016
The diamond partial order has been first introduced for matrices, and then discussed also in the general context of *-regular rings. We extend this notion to Rickart rings, and state various properties of the diamond order living on the so-called strong Rickart rings. In particular, it is compared with the weak space preorder and the star order; also existence of certain meets and joins under diamond order is discussed.
Existence of dynamical low-rank approximations to parabolic problems
2021
The existence and uniqueness of weak solutions to dynamical low-rank evolution problems for parabolic partial differential equations in two spatial dimensions is shown, covering also non-diagonal diffusion in the elliptic part. The proof is based on a variational time-stepping scheme on the low-rank manifold. Moreover, this scheme is shown to be closely related to practical methods for computing such low-rank evolutions.