Three dimensional Sklyanin algebras and Gröbner bases

We consider Sklyanin algebras $S$ with 3 generators, which are quadratic algebras over a field $\K$ with $3$ generators $x,y,z$ given by $3$ relations $pxy+qyx+rzz=0$, $pyz+qzy+rxx=0$ and $pzx+qxz+ryy=0$, where $p,q,r\in\K$. this class of algebras has enjoyed much attention. In particular, using tools from algebraic geometry, Feigin, Odesskii \cite{odf}, and Artin, Tate and Van Den Bergh, showed that if at least two of the parameters $p$, $q$ and $r$ are non-zero and at least two of three numbers $p^3$, $q^3$ and $r^3$ are distinct, then $S$ is Artin--Schelter regular. More specifically, $S$ is Koszul and has the same Hilbert series as the algebra of commutative polynomials in 3 indeterminates (PHS). It has became commonly accepted that it is impossible to achieve the same objective by purely algebraic and combinatorial means like the Groebner basis technique. The main purpose of this paper is to trace the combinatorial meaning of the properties of Sklyanin algebras, such as Koszulity, PBW, PHS, Calabi-Yau, and to give a new constructive proof of the above facts due to Artin, Tate and Van Den Bergh. Further, we study a wider class of Sklyanin algebras, namely
the situation when all parameters of relations could be different. We call them generalized Sklyanin algebras. We classify up to isomorphism all generalized Sklyanin algebras with the same Hilbert series as commutative polynomials on
3 variables. We show that generalized Sklyanin algebras in general position have a Golod–Shafarevich Hilbert series (with exception of the case of field with two elements).

Geometric Hamiltonian formulation of a variational problem depending on the covariant acceleration

We consider a second-order variational problem depending on the covariant acceleration, which is related to the notion of Riemannian cubic polynomials. This problem and the corresponding optimal control problem are described in the context of higher order tangent bundles using geometric tools. The main tool, a presymplectic variant of Pontryagin’s maximum principle, allows us to study the dynamics of the control problem.

Series representations of the remainders in the expansions for certain functions with applications

We present a summary of the series representations of the remainders in the expansions in ascending powers of t of 2/(et+1)2/(et+1) , sech t and coth t and establish simple bounds for these remainders when t>0t>0 . Several applications of these expansions are given which enable us to deduce some inequalities and completely monotonic functions associated with the ratio of two gamma functions. In addition, we derive a (presumably new) quadratic recurrence relation for the Bernoulli numbers Bn.

Symmetric Interior Penalty DG Methods for the Compressible Navier-Stokes Equations I: Method Formulation

In this article we consider the development of discontinuous Galerkin finite element methods for the numerical approximation of the compressible Navier-Stokes equations. For the discretization of the leading order terms, we propose employing the generalization of the symmetric version of the interior penalty method, originally developed for the numerical approximation of linear self-adjoint second-order elliptic partial differential equations. In order to solve the resulting system of nonlinear equations, we exploit a (damped) Newton-GMRES algorithm. Numerical experiments demonstrating the practical performance of the proposed discontinuous Galerkin method with higher-order polynomials are presented.

Three-dimensional, in-silico breast phantom for multimodality image simulations

We report on the construction of anatomically realistic three-dimensional in-silico breast phantoms with adjustable sizes, shapes and morphologic features. The concept of multiscale spatial resolution is implemented for generating breast tissue images from multiple modalities. Breast epidermal boundary and subcutaneous fat layer is generated by fitting an ellipsoid and 2nd degree polynomials to reconstructive surgical data and ultrasound imaging data. Intraglandular fat is simulated by randomly distributing and orienting adipose ellipsoids within a fibrous region immediately within the dermal layer. Cooper’s ligaments are simulated as fibrous ellipsoidal shells distributed within the subcutaneous fat layer. Individual ductal lobes are simulated following a random binary tree model which is generated based upon probabilistic branching conditions described by ramification matrices, as originally proposed by Bakic et al [3, 4]. The complete ductal structure of the breast is simulated from multiple lobes that extend from the base of the nipple and branch towards the chest wall. As lobe branching progresses, branches are reduced in height and radius and terminal branches are capped with spherical lobular clusters. Biophysical parameters are mapped onto the complete anatomical model and synthetic multimodal images (Mammography, Ultrasound, CT) are generated for phantoms of different adipose percentages (40%, 50%, 60%, and 70%) and are analytically compared with clinical examples. Results demonstrate that the in-silico breast phantom has applications in imaging performance evaluation and, specifically, great utility for solving image registration issues in multimodality imaging.

The tetrahexahedric angular Calogero model

The spherical reduction of the rational Calogero model (of type A n−1 and after removing the center of mass) is considered as a maximally superintegrable quantum system, which describes a particle on the (n−2)-sphere subject to a very particular potential. We present a detailed analysis of the simplest non-separable case, n=4, whose potential is singular at the edges of a spherical tetrahexahedron. A complete set of independent conserved charges and of Hamiltonian intertwiners is constructed, and their algebra is elucidated. They arise from the ring of polynomials in Dunkl-deformed angular momenta, by classifying the subspaces invariant and antiinvariant under all Weyl reflections, respectively.

Holomorphic functions on non-Runge domains and related problems.

Let U be a domain in CN that is not a Runge domain. We study the topological and algebraic properties of the family of holomorphic functions on U which cannot be approximated by polynomials.

Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding

With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.

Dynamic Image Precompensation for Improving Visual Performance of Computer Users with Ocular Aberrations

With the progress of computer technology, computers are expected to be more intelligent in the interaction with humans, presenting information according to the user's psychological and physiological characteristics. However, computer users with visual problems may encounter difficulties on the perception of icons, menus, and other graphical information displayed on the screen, limiting the efficiency of their interaction with computers. In this dissertation, a personalized and dynamic image precompensation method was developed to improve the visual performance of the computer users with ocular aberrations. The precompensation was applied on the graphical targets before presenting them on the screen, aiming to counteract the visual blurring caused by the ocular aberration of the user's eye. A complete and systematic modeling approach to describe the retinal image formation of the computer user was presented, taking advantage of modeling tools, such as Zernike polynomials, wavefront aberration, Point Spread Function and Modulation Transfer Function. The ocular aberration of the computer user was originally measured by a wavefront aberrometer, as a reference for the precompensation model. The dynamic precompensation was generated based on the resized aberration, with the real-time pupil diameter monitored. The potential visual benefit of the dynamic precompensation method was explored through software simulation, with the aberration data from a real human subject. An "artificial eye'' experiment was conducted by simulating the human eye with a high-definition camera, providing objective evaluation to the image quality after precompensation. In addition, an empirical evaluation with 20 human participants was also designed and implemented, involving image recognition tests performed under a more realistic viewing environment of computer use. The statistical analysis results of the empirical experiment confirmed the effectiveness of the dynamic precompensation method, by showing significant improvement on the recognition accuracy. The merit and necessity of the dynamic precompensation were also substantiated by comparing it with the static precompensation. The visual benefit of the dynamic precompensation was further confirmed by the subjective assessments collected from the evaluation participants.

Equivalent norms in polynomial spaces and applications.

In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy Littlewood constants for 2-homogeneous polynomials on l(p)(2) spaces, 2 < p <= infinity. We also provide lower estimates for the Hardy-Littlewood constants for polynomials of higher degrees.

E-polynomial of SL(2,C)-character varieties of complex curves of genus 3.

We compute the E-polynomials of the moduli spaces of representations of the fundamental group of a complex curve of genus g = 3 into SL(2, C), and also of the moduli space of twisted representations. The case of genus g = 1, 2 has already been done in [12]. We follow the geometric technique introduced in [12], based on stratifying the space of representations, and on the analysis of the behaviour of the E-polynomial under fibrations.

The generating function of the generalized Fibonacci sequence

Using tools of the theory of orthogonal polynomials we obtain the generating function of the generalized Fibonacci sequence established by Petronilho for a sequence of real or complex numbers {Qn} defined by Q0 = 0, Q1 = 1, Qm = ajQm−1 + bjQm−2, m ≡ j (mod k), where k ≥ 3 is a fixed integer, and a0, a1, . . . , ak−1, b0, b1, . . . , bk−1 are 2k given real or complex numbers, with bj #0 for 0 ≤ j ≤ k−1. For this sequence some convergence proprieties are obtained.