相关论文: Designs for 24-vertex snarks

We investigate an alternative solution method to the joint signal-beamformer optimization problem considered by Setlur and Rangaswamy[1]. First, we directly demonstrate that the problem, which minimizes the received noise, interference, and…

A numerical algorithm is presented to solve a benchmark problem proposed by Hemker. The algorithm incorporates asymptotic information into the design of appropriate piecewise-uniform Shishkin meshes. Moreover, different co-ordinate systems…

We classify all untwisted (2,1) heterotic strings. The only solutions are the three already known cases, having massless spectra consisting either of 24 chiral fermions, or of 24 bosons, or of 8 scalars and 8 fermions of each chirality.

Certain black branes are unstable toward fluctuations that lead to non-uniform mass distributions. We study static, non-uniform solutions that differ only perturbatively from uniform ones. For uncharged black strings in five dimensions, we…

Many real-life problems of practical importance -- spanning a wide range of applications from chip design to bioinformatics -- represent constraint satisfaction problems, where classical solvers have to rely on heuristic approximations due…

In this work we propose a mechanism for converting the spectral problem of vertex models transfer matrices into the solution of certain linear partial differential equations. This mechanism is illustrated for the…

Second order nonlinear eigenvalue problems are considered for which the spectrum is an interval. The boundary conditions are of Robin and Dirichlet type. The shape and the number of solutions are discussed by means of a phase plane…

The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of $g$-group encodable and $g$-group decodable linear STBCs is…

In this paper we present several practically-oriented extensions and considerations for the virtual noise method in optimal design under correlation. First we introduce a slightly modified virtual noise representation which further…

In this note six Steiner systems $S(2,8,225)$ and four Steiner systems $S(2,9,289)$ are presented. This resolves two of $129$ undecided cases for block designs with block length $8$ and $9$, mentioned in Handbook of Combinatorial Designs.

Heterotic string theory has nonsupersymmetric branes whose existence is suggested by the cobordism conjecture. We numerically construct static, spherically symmetric, and asymptotically flat black brane solutions in ten-dimensional…

Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…

We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.

We survey some aspects of the perfect matching problem in hypergraphs, with particular emphasis on structural characterisation of the existence problem in dense hypergraphs and the existence of designs.

This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of…

In integrated circuit design, the analysis of wafer map patterns is critical to improve yield and detect manufacturing issues. We develop Wafer2Spike, an architecture for wafer map pattern classification using a spiking neural network…

We investigate strings theories as defined from four dimensional gauge theories. It is argued that novel (super)string theories exist up to 26 dimensions. Some of them may support weakly curved geometries.

In this work, we study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes…

We propose that simple neural networks (NNs) trained on crossing symmetry can reconstruct conformal correlators restricted to a line to remarkable accuracy. The input is minimal: an external scaling dimension, a spectral gap, and the value…

Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) provides a means of defining…