Combinatorial QFT and the Jacobian Conjecture

The Jacobian Conjecture states that any complex n-dimensional locally invertible polynomial system is globally invertible with polynomial inverse. In 1982, Bass et al. proved an important reduction theorem stating that the conjecture is true for any degree of the polynomial system if it is true in degree three. This degree reduction is obtained with the price of increasing the dimension n. We show in this chapter a result concerning partial elimination of variables, which implies a reduction of the generic case to the quadratic one. The price to pay is the introduction of a supplementary parameter 0≤n′≤n, parameter which represents the dimension of a linear subspace where some particular conditions on the system must hold. We exhibit a proof, in a QFT formulation, using the intermediate field method exposed in Chapter 3.

Spatiotemporal Complexity Analysis for a Space-Time Discrete Generalized Toxic-Phytoplankton-Zooplankton Model with Self-Diffusion and Cross-Diffusion

In this paper, a couple map lattice (CML) model is used to study the spatiotemporal dynamics and Turing patterns for a space-time discrete generalized toxic-phytoplankton-zooplankton system with self-diffusion and cross-diffusion. First, the existence and stability conditions for fixed points are obtained by using linear stability analysis. Second, the conditions for the occurrence of flip bifurcation, Neimark–Sacker bifurcation and Turing bifurcation are obtained by using the center manifold reduction theorem and bifurcation theory. The results show that there exist two nonlinear mechanisms, flip-Turing instability and Neimark–Sacker–Turing instability. Moreover, some numerical simulations are used to illustrate the theoretical results. Interestingly, rich dynamical behaviors, such as periodic points, periodic or quasi-periodic orbits, chaos and interesting patterns (plaques, curls, spirals, circles and other intermediate patterns) are found. The results obtained in the CML model contribute to comprehending the complex pattern formation of spatially extended discrete generalized toxic-phytoplankton-zooplankton system.

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network.

Stacky Hamiltonian Actions and Symplectic Reduction

We introduce the notion of a Hamiltonian action of an étale Lie group stack on an étale symplectic stack and establish versions of the Kirwan convexity theorem, the Meyer–Marsden–Weinstein symplectic reduction theorem, and the Duistermaat–Heckman theorem in this context.