Projective free algebras of continuous functions on compact abelian groups

It is proved that the Wiener algebra of functions on a connected compact abelian group whose Bohr-Fourier spectra are contained in a fixed subsemigroup of the (additive) dual group, is projective free. The semigroup is assumed to contain zero and have the property that it does not contain both a nonzero element and its opposite. The projective free property is proved also for the algebra of continuous functions with the same condition on their Bohr-Fourier spectra. As an application, the connected components of the set of factorable matrices are described. The proofs are based on a key result on homotopies of continuous maps on the maximal ideal spaces of the algebras under consideration.     

On cocycle twisting of compact quantum groups

We provide a class of examples of compact quantum groups and unitary 2-cocycles on them, such that the twisted quantum groups are non-compact, but still locally compact quantum groups (in the sense of Kustermans and Vaes). This also gives examples of cocycle twists where the underlying C^∗-algebra of the quantum group changes.     

Numerical range and quasi-sectorial contractions

A method developed in Arlinski? (1987) [1] is applied to study the numerical range of quasi-sectorial contractions and to prove three main results. Our first theorem gives characterization of the maximal sectorial generator A in terms of the corresponding contraction semigroup {exp(−tA)}_t?0. The second result establishes for these quasi-sectorial contractions a quite accurate localization of their numerical range. We give for this class of semigroups a new proof of the Euler operator-norm approximation: exp(−tA)=limn→∞(I+tA/n)⁻ⁿ, t?0, with the optimal estimate: O(1/n), of the convergence rate, which takes into account the value of the sectorial generator angle (the third result).     

The operator formula for monotone triangles - simplified proof and three generalizations

We provide a simplified proof of our operator formula for the number of monotone triangles with prescribed bottom row, which enables us to deduce three generalizations of the formula. One of the generalizations concerns a certain weighted enumeration of monotone triangles which specializes to the weighted enumeration of alternating sign matrices with respect to the number of −1s in the matrix when prescribing (1,2,…,n) as the bottom row of the monotone triangle.     

Equivalent operator preconditioning for elliptic problems with nonhomogeneous mixed boundary conditions

The numerical solution of linear elliptic partial differential equations often involves finite element discretization, where the discretized system is usually solved by some conjugate gradient method. The crucial point in the solution of the obtained discretized system is a reliable preconditioning, that is to keep the condition number of the systems under control, no matter how the mesh parameter is chosen. The PCG method is applied to solving convection-diffusion equations with nonhomogeneous mixed boundary conditions. Using the approach of equivalent and compact-equivalent operators in Hilbert space, it is shown that for a wide class of elliptic problems the superlinear convergence of the obtained preconditioned CGM is mesh independent under FEM discretization.     

A high-resolution code for turbulent boundary layers

A new high-resolution code for the direct simulation of incompressible boundary layers over a flat plate is described. It can accommodate a wide range of pressure gradients, and general time-dependent boundary conditions such as incoming wakes or wall forcing. The consistency orders of the advective and pressure-correction steps are different, but it is shown that the overall resolution is controlled by the higher-order advection step. The formulation of boundary conditions to ensure global mass conservation in the presence of arbitrary forcing is carefully analyzed. Two validation boundary layers with and without a strong adverse pressure gradient are presented, with maximum Reynolds numbers Re_θ≈2000${\mathit{Re}}_{\theta }\approx 2000$. They agree well with the available experiments. Turbulent inflow conditions for the zero-pressure case are implemented by a recycling method, and it is shown that at least the initial 300 momentum thicknesses have to be discarded before the effect of the artificial inflow is forgotten. It is argued that this is not a defect of the method used to generate the inflow, but a property of the boundary layer.     

Maximum entropy algorithm with inexact upper entropy bound based on Fup basis functions with compact support

The maximum entropy (MaxEnt) principle is a versatile tool for statistical inference of the probability density function (pdf) from its moments as a least-biased estimation among all other possible pdf’s. It maximizes Shannon entropy, satisfying the moment constraints. Thus, the MaxEnt algorithm transforms the original constrained optimization problem to the unconstrained dual optimization problem using Lagrangian multipliers. The Classic Moment Problem (CMP) uses algebraic power moments, causing typical conventional numerical methods to fail for higher-order moments (m>5–10)$(m>5''–''10)$ due to different sensitivities of Lagrangian multipliers and unbalanced nonlinearities. Classic MaxEnt algorithms overcome these difficulties by using orthogonal polynomials, which enable roughly the same sensitivity for all Lagrangian multipliers. In this paper, we employ an idea based on different principles, using Fup_n${\mathit{Fup}}_n$ basis functions with compact support, which can exactly describe algebraic polynomials, but only if the Fup order-n   is greater than or equal to the polynomial’s order. Our algorithm solves the CMP with respect to the moments of only low order Fup₂${\mathit{Fup}}_2$ basis functions, finding a Fup₂${\mathit{Fup}}_2$ optimal pdf with better balanced Lagrangian multipliers. The algorithm is numerically very efficient due to localized properties of Fup₂${\mathit{Fup}}_2$ basis functions implying a weaker dependence between Lagrangian multipliers and faster convergence. Only consequences are an iterative scheme of the algorithm where power moments are a sum of Fup₂${\mathit{Fup}}_2$ and residual moments and an inexact entropy upper bound. However, due to small residual moments, the algorithm converges very quickly as demonstrated on two continuous pdf examples – the beta distribution and a bi-modal pdf, and two discontinuous pdf examples – the step and double Dirac pdf. Finally, these pdf examples present that Fup MaxEnt algorithm yields smaller entropy value than classic MaxEnt algorithm, but differences are very small for all practical engineering purposes.     

Perturbations of unitary representations of finite dimensional Lie groups

In quantum physical theories, interactions in a system of particles are commonly understood as perturbations to certain observables, including the Hamiltonian, of the corresponding interaction-free system. The manner in which observables undergo perturbations is subject to constraints imposed by the overall symmetries that the interacting system is expected to obey. Primary among these are the spacetime symmetries encoded by the unitary representations of the Galilei group and Poincaré group for the non-relativistic and relativistic systems, respectively. In this light, interactions can be more generally viewed as perturbations to unitary representations of connected Lie groups, including the non-compact groups of spacetime symmetry transformations. In this paper, we present a simple systematic procedure for introducing perturbations to (infinite dimensional) unitary representations of finite dimensional connected Lie groups. We discuss applications to relativistic and non-relativistic particle systems.     

A Representation of Quantum Measurement in Nonassociative Algebras

Starting from an abstract setting for the Lüders-von Neumann quantum measurement process and its interpretation as a probability conditionalization rule in a non-Boolean event structure, the author derived a certain generalization of operator algebras in a preceding paper. This is an order-unit space with some specific properties. It becomes a Jordan operator algebra under a certain set of additional conditions, but does not own a multiplication operation in the most general case. A major objective of the present paper is the search for such examples of the structure mentioned above that do not stem from Jordan operator algebras; first natural candidates are matrix algebras over the octonions and other nonassociative rings. Therefore, the case when a nonassociative commutative multiplication exists is studied without assuming that it satisfies the Jordan condition. The characteristics of the resulting algebra are analyzed. This includes the uniqueness of the spectral resolution as well as a criterion for its existence, subalgebras that are Jordan algebras, associative subalgebras, and more different levels of compatibility than occurring in standard quantum mechanics. However, the paper cannot provide the desired example, but contribute to the search by the identification of some typical differences between the potential examples and the Jordan operator algebras and by negative results concerning some first natural candidates. The possibility that no such example exists cannot be ruled out. However, this would result in an unexpected new characterization of Jordan operator algebras, which would have a significant impact on quantum axiomatics since some customary axioms (e.g., power-associativity or the sum postulate for observables) might turn out to be redundant then.     

基于CompactRIO的高速转塔式测试分选控制系统设计

对高速转塔式测试分选控制系统进行设计。介绍了单颗芯片测试的整个工序流程,在此基础上采用CompactRIO为核心控制器,运用模块化设计方法建立了分选机系统控制框架,各模块与控制器之间的连接通过总线或者I/O口连接在一起。在软件架构上采用三层软件架构的设计方法对分选机控制系统进行设计,讨论了三层架构即表示层,逻辑层,操作层在转塔式测试分选机软件架构上的作用,且三层之间的联系是表示层联系逻辑层,逻辑层联系操作层,操作层与外界各个硬件的沟通,此外对芯片检测数据流存储进行了设计。这种控制系统设计能较大地提高转塔式测试分选机的工作效率和运行速度。