String representations of the Wilson loop and of the non-Abelian analog of the 't Hooft loop, defined on the string world-sheet, in the 4D Georgi-Glashow model are found in the BPS limit. In the first case, only the massless photon interacts with the string, while the interaction of the massive gauge bosons yields perimeter type terms. Contrary, in the second case, massive bosons also interact ...

Introduction Enceladus is emitting measurable heat (37 GW) from a region centered on its South Pole [1]. Radioactive and accretional heating are expected to be minimal for such a small, low-density body, implying that the observed heat flow is due to past or present tidal dissipation [2]. The tidal heat production for which Enceladus’ eccentricity is in steady state, however, cannot exceed 1.1 ...

Let (W, S) be a Coxeter system, with W a finite, irreducible Coxeter group and let GW be the associated Artin group (see Bourbaki [5] for an introduction to Coxeter groups and their classifications and Brieskorn and Saito [6] for relations between Coxeter groups and Artin groups ). The main objects of study of this paper are the Artin groups of type An . We recall that the Artin group GAn is th...

We present the result of N -body simulations of dynamical evolution of triple massive blackhole (BH) systems in galactic nuclei. We found that in most cases two of the three BHs merge through gravitational wave (GW) radiation in the timescale much shorter than the Hubble time, before ejecting one BH through a slingshot. In order for a binary BH to merge before ejecting out the third one, it has...

A spelling error detection and correction application is based on three main components: a dictionary (or reference word list), an error model and a language model. While most of the attention in the literature has been directed to the language model, we show how improvements in any of the three components can lead to significant cumulative improvements in the overall performance of the system....

In this paper with two equivalent representations of the information contained by a SAT formula, the reason why string generated by succinct SAT formula can be greatly compressed is firstly presented based on Kolmogorov complexity theory. Then what strings can be greatly compressed were classified and discussed. In this way we discovered the SAT problem was composed of a basic problem: distingu...

We consider linear error correcting codes associated to higher-dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry. This is illustrated by codes associated to Schubert varieties in Grassmannians, called Schubert codes, which have...

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with prescribed parameters. As an application of our results, we recover the formulas for the minimum distance of various families of evaluation codes.

We introduce the notion of the Gromov-Hausdorff fuzzy distance between two non-Archimedean fuzzy metric spaces (in the sense of Kramosil and Michalek). Basic properties involving convergence and the fuzzy version of the completeness theorem are presented. We show that the topological properties induced by the classic Gromov-Hausdorff distance on metric spaces can be deduced from our approach.