Characteristics of an Ising-like Model with Ferromagnetic and Antiferromagnetic Interactions.

In the framework of mean field approximation, we consider a spin system consisting of two interacting sub-ensembles. The intra-ensemble interactions are ferromagnetic, while the inter-ensemble interactions are antiferromagnetic. We define the effective number of the nearest neighbors and show that if the two sub-ensembles have the same effective number of the nearest neighbors, the classical form of critical exponents (α=0, β=1/2, γ=γ'=1, δ=3) gives way to the non-classical form (α=0, β=3/2, γ=γ'=0, δ=1), and the scaling function changes simultaneously.

Generalized Solution of Inverse Problem for Ising Connection Matrix on -Dimensional Hypercubic Lattice.

We analyze a connection matrix of a d-dimensional Ising system and solve the inverse problem, restoring the constants of interaction between spins, based on the known spectrum of its eigenvalues. When the boundary conditions are periodic, we can account for interactions between spins that are arbitrarily far. In the case of the free boundary conditions, we have to restrict ourselves with interactions between the given spin and the spins of the first d coordination spheres.

Analytical Expressions for Ising Models on High Dimensional Lattices.

We use an -vicinity method to examine Ising models on hypercube lattices of high dimensions d≥3. This method is applicable for both short-range and long-range interactions. We introduce a small parameter, which determines whether the method can be used when calculating the free energy.

Investigation of Finite-Size 2D Ising Model with a Noisy Matrix of Spin-Spin Interactions.

We analyze changes in the thermodynamic properties of a spin system when it passes from the classical two-dimensional Ising model to the spin glass model, where spin-spin interactions are random in their values and signs. Formally, the transition reduces to a gradual change in the amplitude of the multiplicative noise (distributed uniformly with a mean equal to one) superimposed over the initial Ising matrix of interacting spins. Considering the noise, we obtain analytical expressions that are valid for lattices of finite sizes.

Optical solver of combinatorial problems: nanotechnological approach.

We present an optical computing system to solve NP-hard problems. As nano-optical computing is a promising venue for the next generation of computers performing parallel computations, we investigate the application of submicron, or even subwavelength, computing device designs. The system utilizes a setup of exponential sized masks with exponential space complexity produced in polynomial time preprocessing.

Weighted patterns as a tool for improving the Hopfield model.

We generalize the standard Hopfield model to the case when a weight is assigned to each input pattern. The weight can be interpreted as the frequency of the pattern occurrence at the input of the network. In the framework of the statistical physics approach we obtain the saddle-point equation allowing us to examine the memory of the network.