Duality and free energy analyticity bounds for few-body Ising models with extensive homology rank

We consider pairs of few-body Ising models where each spin enters a bounded number of interaction terms (bonds) such that each model can be obtained from the dual of the other after freezing k spins on large-degree sites. Such a pair of Ising models can be interpreted as a two-chain complex with k being the rank of the first homology group. Our focus is on the case where k is extensive, that is, scales linearly with the number of bonds n. Flipping any of these additional spins introduces a homologically nontrivial defect (generalized domain wall). In the presence of bond disorder, we prove the existence of a low-temperature weak-disorder region where additional summation over the defects has no effect on the free energy density f(T) in the thermodynamical limit and of a high-temperature region where an extensive homological defect does not affect f(T). We also discuss the convergence of the high- and low-temperature series for the free energy density, prove the analyticity of limiting f(T) at high and low temperatures, and construct inequalities for the critical point(s) where analyticity is lost. As an application, we prove multiplicity of the conventionally defined critical points for Ising models on all { f, d} tilings of the infinite hyperbolic plane, where df/(d + f) \u3e 2. Namely, for these infinite graphs, we show that critical temperatures with free and wired boundary conditions differ, Tc(f)T(f)

Optimal modeling for complex system design

The article begins with a brief introduction to the theory describing optimal data compression systems and their performance. A brief outline is then given of a representative algorithm that employs these lessons for optimal data compression system design. The implications of rate-distortion theory for practical data compression system design is then described, followed by a description of the tensions between theoretical optimality and system practicality and a discussion of common tools used in current algorithms to resolve these tensions. Next, the generalization of rate-distortion principles to the design of optimal collections of models is presented. The discussion focuses initially on data compression systems, but later widens to describe how rate-distortion theory principles generalize to model design for a wide variety of modeling applications. The article ends with a discussion of the performance benefits to be achieved using the multiple-model design algorithms

2-cancellative hypergraphs and codes

A family of sets F (and the corresponding family of 0-1 vectors) is called t-cancellative if for all distict t+2 members A_1,... A_t and B,C from F the union of A_1,..., A_t and B differs from the union of A_1, ..., A_t and C. Let c(n,t) be the size of the largest t-cancellative family on n elements, and let c_k(n,t) denote the largest k-uniform family. We significantly improve the previous upper bounds, e.g., we show c(n,2) n_0). Using an algebraic construction we show that the order of magnitude of c_{2k}(n,2) is n^k for each k (when n goes to infinity).Comment: 20 page

Multipurpose S-shaped solvable profiles of the refractive index: application to modeling of antireflection layers and quasi-crystals

A class of four-parameter solvable profiles of the electromagnetic admittance has recently been discovered by applying the newly developed Property & Field Darboux Transformation method (PROFIDT). These profiles are highly flexible. In addition, the related electromagnetic-field solutions are exact, in closed-form and involve only elementary functions. In this paper, we focus on those who are S-shaped and we provide all the tools needed for easy implementation. These analytical bricks can be used for high-level modeling of lightwave propagation in photonic devices presenting a piecewise-sigmoidal refractive-index profile such as, for example, antireflection layers, rugate filters, chirped filters and photonic crystals. For small amplitude of the index modulation, these elementary profiles are very close to a cosine profile. They can therefore be considered as valuable surrogates for computing the scattering properties of components like Bragg filters and reflectors as well. In this paper we present an application for antireflection layers and another for 1D quasicrystals (QC). The proposed S-shaped profiles can be easily manipulated for exploring the optical properties of smooth QC, a class of photonic devices that adds to the classical binary-level QC.Comment: 14 pages, 18 fi

Noncommutative Symmetric Functions Associated with a Code, Lazard Elimination, and Witt Vectors

The construction of the universal ring of Witt vectors is related to Lazard's factorizations of free monoids by means of a noncommutative analogue. This is done by associating to a code a specialization of noncommutative symmetric functions

The World of Fast Moving Objects

The notion of a Fast Moving Object (FMO), i.e. an object that moves over a distance exceeding its size within the exposure time, is introduced. FMOs may, and typically do, rotate with high angular speed. FMOs are very common in sports videos, but are not rare elsewhere. In a single frame, such objects are often barely visible and appear as semi-transparent streaks. A method for the detection and tracking of FMOs is proposed. The method consists of three distinct algorithms, which form an efficient localization pipeline that operates successfully in a broad range of conditions. We show that it is possible to recover the appearance of the object and its axis of rotation, despite its blurred appearance. The proposed method is evaluated on a new annotated dataset. The results show that existing trackers are inadequate for the problem of FMO localization and a new approach is required. Two applications of localization, temporal super-resolution and highlighting, are presented

On the Numerical Study of the Complexity and Fractal Dimension of CMB Anisotropies

We consider the problem of numerical computation of the Kolmogorov complexity and the fractal dimension of the anisotropy spots of Cosmic Microwave Background (CMB) radiation. Namely, we describe an algorithm of estimation of the complexity of spots given by certain pixel configuration on a grid and represent the results of computations for a series of structures of different complexity. Thus, we demonstrate the calculability of such an abstract descriptor as the Kolmogorov complexity for CMB digitized maps. The correlation of complexity of the anisotropy spots with their fractal dimension is revealed as well. This technique can be especially important while analyzing the data of the forthcoming space experiments.Comment: LATEX, 3 figure

A semidefinite programming hierarchy for packing problems in discrete geometry

Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for the maximal size of an independent set is to use Lasserre's semidefinite programming hierarchy. We generalize this approach to infinite graphs. For this we introduce topological packing graphs as an abstraction for infinite graphs coming from packing problems in discrete geometry. We show that our hierarchy converges to the independence number.Comment: (v2) 25 pages, revision based on suggestions by referee, accepted in Mathematical Programming Series B special issue on polynomial optimizatio