The Skolem-Bang Theorems in Ordered Fields with an IPIP

This paper is concerned with the extent to which the Skolem-Bang theorems in Diophantine approximations generalise from the standard setting of $$to structures of the form$$, where $F$ is an ordered field and $I$ is an integer part of $F$. We show that some of these theorems are hold unconditionally in general case (ordered fields with an integer part). The remainder results are based on Dirichlet's and Kronecker's theorems. Finally we extend Dirichlet's theorem to ordered fields with $IE_1$ integer part.Comment: 28 page

Languages associated with saturated formations of groups

In a previous paper, the authors have shown that Eilenberg's variety theorem can be extended to more general structures, called formations. In this paper, we give a general method to describe the languages corresponding to saturated formations of groups, which are widely studied in group theory. We recover in this way a number of known results about the languages corresponding to the classes of nilpotent groups, soluble groups and supersoluble groups. Our method also applies to new examples, like the class of groups having a Sylow tower.The authors are supported by Proyecto MTM2010-19938-C03-01 from MICINN (Spain). The first author acknowledges support from MEC. The second author is supported by the project ANR 2010 BLAN 0202 02 FREC. The third author was supported by the Grant PAID-02-09 from Universitat Politècnica de València

Fluids of spherical molecules with dipolar-like nonuniform adhesion. An analytically solvable anisotropic model

We consider an anisotropic version of Baxter's model of `sticky hard spheres', where a nonuniform adhesion is implemented by adding, to an isotropic surface attraction, an appropriate `dipolar sticky' correction (positive or negative, depending on the mutual orientation of the molecules). The resulting nonuniform adhesion varies continuously, in such a way that in each molecule one hemisphere is `stickier' than the other. We derive a complete analytic solution by extending a formalism [M.S. Wertheim, J. Chem. Phys. \textbf{55}, 4281 (1971) ] devised for dipolar hard spheres. Unlike Wertheim's solution which refers to the `mean spherical approximation', we employ a \textit{Percus-Yevick closure with orientational linearization}, which is expected to be more reliable. We obtain analytic expressions for the orientation-dependent pair correlation function $g(1,2)$. Only one equation for a parameter $K$ has to be solved numerically. We also provide very accurate expressions which reproduce $K$ as well as some parameters, $\Lambda_{1}$ and $\Lambda_{2}$, of the required Baxter factor correlation functions with a relative error smaller than 1%. We give a physical interpretation of the effects of the anisotropic adhesion on the $g(1,2)$. The model could be useful for understanding structural ordering in complex fluids within a unified picture.Comment: 30 pages, 6 Figures, Physical Review E in pres

Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean value theorem of Wirsing, and special cases of the mean value theorem of Hal\'asz. By building on the ideas behind our ergodic results, we recast Sarnak's M\"obius disjointness conjecture in a new dynamical framework. This naturally leads to an extension of Sarnak's conjecture which focuses on the disjointness of additive and multiplicative semigroup actions. We substantiate this extension by providing proofs of several special cases thereof

On some aspects of polynomial dynamical systems

The aim of this work is to study exact algebraic criteria local/global observability ([HK77], [Ino77]) for polynomial dynamical system by means of algebraic geometry and computational commutative algebra in the vein of [SR76], [Son79a], [Son79b], [Bai80], [Bai81], [Bar95], [Bar99], [Nes98], [Tib04], [KO13], [Bar16]. A key point in this topic is to work with polynomials with real coefficients and their real roots instead of their complex roots, as it is usually the case ([CLO15], [KR00]). A central concept is then the real radical of an ideal [BN93], [Neu98], [LLM+13], along with the Krivine- Dubois-Risler real nullstellensatz for polynomial rings [Kri64], [Dub70], [Ris70], [BCR98]. Underestimating this point leads to incorrect results (see, e.g. [Bar16] remark on [KO13]). This thesis is therefore devoted to set the necessary algebraic tools in the right context and level of generality (i.e. real algebra and real algebraic geometry) for applications to our dynamical systems and to further develop their exploit in this context. The first two chapters set the algebraic and algebraic geometry preliminaries. The third chapter is devoted to the applications of the previous algebraic concepts to the study of the ob- servability of polynomial dynamical systems. In the last chapter an approach to the construction of Lyapunov funtions to prove stability in estimation problems is presented

Higher uniformity of bounded multiplicative functions in short intervals on average

Let $\lambda$ denote the Liouville function. We show that, as $X \rightarrow \infty$, $$\int_{X}^{2X} \sup_{\substack{P(Y)\in \mathbb{R}[Y]\\ deg(P)\leq k}} \Big | \sum_{x \leq n \leq x + H} \lambda(n) e(-P(n)) \Big |\ dx = o ( X H)$$ for all fixed $k$ and $X^{\theta} \leq H \leq X$ with $0 < \theta < 1$ fixed but arbitrarily small. Previously this was only established for $k \leq 1$. We obtain this result as a special case of the corresponding statement for (non-pretentious) $1$-bounded multiplicative functions that we prove. In fact, we are able to replace the polynomial phases $e(-P(n))$ by degree $k$ nilsequences $\overline{F}(g(n) \Gamma)$. By the inverse theory for the Gowers norms this implies the higher order asymptotic uniformity result $$\int_{X}^{2X} \| \lambda \|_{U^{k+1}([x,x+H])}\ dx = o ( X )$$ in the same range of $H$. We present applications of this result to patterns of various types in the Liouville sequence. Firstly, we show that the number of sign patterns of the Liouville function is superpolynomial, making progress on a conjecture of Sarnak about the Liouville sequence having positive entropy. Secondly, we obtain cancellation in averages of $\lambda$ over short polynomial progressions $(n+P_1(m),\ldots, n+P_k(m))$, which in the case of linear polynomials yields a new averaged version of Chowla's conjecture. We are in fact able to prove our results on polynomial phases in the wider range $H\geq \exp((\log X)^{5/8+\varepsilon})$, thus strengthening also previous work on the Fourier uniformity of the Liouville function.Comment: 104 page

Algebraic geometry for tensor networks, matrix multiplication, and flag matroids

This thesis is divided into two parts, each part exploring a different topic within the general area of nonlinear algebra. In the first part, we study several applications of tensors. First, we study tensor networks, and more specifically: uniform matrix product states. We use methods from nonlinear algebra and algebraic geometry to answer questions about topology, defining equations, and identifiability of uniform matrix product states. By an interplay of theorems from algebra, geometry, and quantum physics we answer several questions and conjectures posed by Critch, Morton and Hackbusch. In addition, we prove a tensor version of the so-called quantum Wielandt inequality, solving an open problem regarding the higher-dimensional version of matrix product states. Second, we present new contributions to the study of fast matrix multiplication. Motivated by the symmetric version of matrix multiplication we study the plethysm S^k(sl_n) of the adjoint representation sl_n of the Lie group SL_n . Moreover, we discuss two algebraic approaches for constructing new tensors which could potentially be used to prove new upper bounds on the complexity of matrix multiplication. One approach is based on the highest weight vectors of the aforementioned plethysm. The other approach uses smoothable finite-dimensional algebras. Finally, we study the Hessian discriminant of a cubic surface, a recently introduced invariant defined in terms of the Waring rank. We express the Hessian discriminant in terms of fundamental invariants. This answers Question 15 of the 27 questions on the cubic surface posed by Bernd Sturmfels. In the second part of this thesis, we apply algebro-geometric methods to study matroids and flag matroids. We review a geometric interpretation of the Tutte polynomial in terms of the equivariant K-theory of the Grassmannian. By generalizing Grassmannians to partial flag varieties, we obtain a new invariant of flag matroids: the flag-geometric Tutte polynomial. We study this invariant in detail, and prove several interesting combinatorial properties

Finitely Correlated States on Quantum Spin Chains

We study a construction, which yields a class of translation invariant states on quantum spin chains, characterised by the property that the correlations across any bond can be modelled on a finite dimensional vector space. These states, which are dense in the set of all translation invariant states, can be considered as generalised valence bond states. We develop a complete theory of the ergodic decomposition of such states, including the decomposition into periodic "Néel ordered" states. Ergodic finitely correlated states have exponential decay of correlations. All states considered can be considered as "functions" of states of a special kind, so-called "purely generated states", which are shown to be ground states for suitably chosen interactions. We show that all these states have a spectral gap. Our theory does not require symmetry of the state with respect to a local gauge group, but the isotropic ground states of some one-dimensional antiferromagnets, recently studied by Affleck, Kennedy, Lieb, and Tasaki fall in this class

Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)

This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICM-ID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels. For BICM-ID over a single-antenna frequency non-selective fading channel, the problem of mapping over multiple symbols, i.e., multi-dimensional (multi-D) mapping, with 8-PSK constellation is investigated. An explicit algorithm to construct a good multi-D mapping of 8-PSK to improve the asymptotic performance of BICM-ID systems is introduced. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (1-dimensional complex) mapping and the multi-D mapping found previously by computer search is thoroughly demonstrated. In addition to the mapping issue in single-antenna BICM-ID systems, the use of signal space diversity (SSD), also known as linear constellation precoding (LCP), is considered in BICM-ID over frequency non-selective fading channels. The performance analysis of BICM-ID and complex N-dimensional signal space diversity is carried out to study its performance limitation, the choice of the rotation matrix and the design of a low-complexity receiver. Based on the design criterion obtained from a tight error bound, the optimality of the rotation matrix is established. It is shown that using the class of optimal rotation matrices, the performance of BICM-ID systems over a frequency non-selective Rayleigh fading channel approaches that of the BICM-ID systems over an additive white Gaussian noise (AWGN) channel when the dimension of the signal constellation increases. Furthermore, by exploiting the sigma mapping for any M-ary quadrature amplitude modulation (QAM) constellation, a very simple sub-optimal, yet effective iterative receiver structure suitable for signal constellations with large dimensions is proposed. Simulation results in various cases and conditions indicate that the proposed receiver can achieve the analytical performance bounds with low complexity. The application of BICM-ID with SSD is then extended to the case of cascaded Rayleigh fading, which is more suitable to model mobile-to-mobile communication channels. By deriving the error bound on the asymptotic performance, it is first illustrated that for a small modulation constellation, a cascaded Rayleigh fading causes a much more severe performance degradation than a conventional Rayleigh fading. However, BICM-ID employing SSD with a sufficiently large constellation can close the performance gap between the Rayleigh and cascaded Rayleigh fading channels, and their performance can closely approach that over an AWGN channel. In the next step, the use of SSD in BICM-ID over frequency selective Rayleigh fading channels employing a multi-carrier modulation technique known as orthogonal frequency division multiplexing (OFDM) is studied. Under the assumption of correlated fading over subcarriers, a tight bound on the asymptotic error performance for the general case of applying SSD over all N subcarriers is derived and used to establish the best achievable asymptotic performance by SSD. It is then shown that precoding over subgroups of at least L subcarriers per group, where L is the number of channel taps, is sufficient to obtain this best asymptotic error performance, while significantly reducing the receiver complexity. The optimal joint subcarrier grouping and rotation matrix design is subsequently determined by solving the Vandermonde linear system. Illustrative examples show a good agreement between various analytical and simulation results. Further, by combining the ideas of multi-D mapping and subcarrier grouping, a novel power and bandwidth-efficient bit-interleaved coded modulation with OFDM and iterative decoding (BI-COFDM-ID) in which multi-D mapping is performed over a group of subcarriers for broadband transmission in a frequency selective fading environment is proposed. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multi-D mapping for BICM-ID in frequency non-selective Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with SSD. Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using SSD and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth and receiver complexity. Finally, the investigation is extended to the application of BICM-ID over a multiple-input multiple-output (MIMO) system equipped with multiple antennas at both the transmitter and the receiver to exploit both time and spatial diversities, where neither the transmitter nor the receiver knows the channel fading coefficients. The concentration is on the class of unitary constellation, due to its advantages in terms of both information-theoretic capacity and error probability. The tight error bound with respect to the asymptotic performance is also derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, by using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. Analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping