相关论文: Minimal independent couplings at order $\alpha'^2$
In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…
The idea of reduction of couplings consists in the search for relations between seemingly independent couplings of a renormalizable theory that are renormalization group invariant. In this article, we demonstrate the existence of such…
We develop the realistic minimal electronic model for recently discovered BiS$_2$ superconductors including the spin-orbit coupling based on a first-principles band structure calculations. Due to strong spin-orbit coupling, characteristic…
The ambiguities inherent in renormalization are considered when using mass-independent renormalization in massless theories that involve two coupling coupling constants. We review how there is no renormalization scheme in which the…
The goal of this chapter is to illustrate a generalization of the Fibonacci word to the case of 2-dimensional configurations on $\mathbb{Z}^2$. More precisely, we consider a particular subshift of $\mathcal{A}^{\mathbb{Z}^2}$ on the…
We give a simple characterisation of the distribution of the independence number, and equivalently the matching number, of a random tree on $n$ labelled vertices chosen uniformly among the $n^{n-2}$ such trees: Roll an $n$-sided die…
A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…
A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {\it et al.} have characterized the minimizing graphs in the class…
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of…
We present accurate numerical estimates for the correlation amplitudes of leading and main subleading terms of the two- and four-spin correlation functions in the one-dimensional spin-1/2 XXZ model under a magnetic field. These data are…
We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.
The linking number is the simplest link invariant given by Gauss; it is the first Gauss diagram formula expressed by one arrow among two circles. Proceeding the next stage, we study the second Gauss diagram formula consisting of two arrows…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
New results are reported from tests of a low-energy effective field theory (EFT) that includes a dilaton field to describe the emergent light scalar with ${ 0^{++} }$ quantum numbers in the strongly coupled near-conformal gauge theory with…
A zero-field Ising model with ferromagnetic coupling constants on the so-called Labyrinth tiling is investigated. Alternatively, this can be regarded as an Ising model on a square lattice with a quasi-periodic distribution of up to eight…
The minimum distance of all binary linear codes with dimension at most eight is known. The smallest open case for dimension nine is length $n=46$ with known bounds $19\le d\le 20$. Here we present a $[46,9,20]_2$ code and show its…
In this work, we explore an extension of Hilbert series techniques to count operators that include derivatives. For sufficiently low-derivative operators, we find an algorithm that gives the number of invariant operators, properly…
We introduce the single-copy entanglement as a quantity to assess quantum correlations in the ground state in quantum many-body systems. We show for a large class of models that already on the level of single specimens of spin chains,…
We propose an algorithm to find a solution to an integro-differential equation of the DGLAP type for all the orders in the running coupling $\alpha$ with splitting functions given at a fixed order in $\alpha.$ Complex analysis is…
We investigate the renormalization group flows and fixed point structure of many coupled minimal models. The models are coupled two by two by energy-energy couplings. We take the general approach where the bare couplings are all taken to be…