相关论文: Fully Packed Loops in a triangle: matchings, paths…
We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…
Tripod configurations of plane curves, formed by certain triples of normal lines coinciding at a point, were introduced by Tabachnikov, who showed that $C^2$ closed convex curves possess at least two tripod configurations. Later, Kao and…
A variant of the complex Ginzburg-Landau equation is used to investigate the frequency locking phenomena in spatially extended systems. With appropriate parameter values, a variety of frequency-locked patterns including flats, $\pi$ fronts,…
We introduce manifestly crossing-symmetric expansions for arbitrary systems of 1D CFT correlators. These expansions are given in terms of certain Polyakov blocks which we define and show how to compute efficiently. Equality of OPE and…
Hyperspherical Prototypical Learning (HPL) is a supervised approach to representation learning that designs class prototypes on the unit hypersphere. The prototypes bias the representations to class separation in a scale invariant and known…
Rod packings are used in crystallography to describe crystal structures with linear or zigzag chains of particles, and each rod packing can be topologically viewed as a collection of disjoint geodesics in the 3-torus. Hui and Purcell…
Fuchsian groups with a modular embedding have the richest arithmetic properties among non-arithmetic Fuchsian groups. But they are very rare, all known examples being related either to triangle groups or to Teichmueller curves. In Part I of…
In this paper we give the complete classification of solitons for a cubic NLS equation on the simplest network with a non-trivial topology: the tadpole graph, i.e. a ring with a half-line attached to it and free boundary conditions at the…
This paper is devoted to condition numbers of the total least squares problem with linear equality constraint (TLSE). With novel limit techniques, closed formulae for normwise, mixed and componentwise condition numbers of the TLSE problem…
In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…
The restricted Feynman path integrals (RFPIs) have been proposed to study continuous quantum measurements in physics. The RFPIs are heuristically determined in terms of the usual probability amplitude multiplied by weight for each path,…
The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear codes is a fundamental problem in coding theory. In this paper,…
Superregular matrices have the property that all of their submatrices, which can be full rank are so. Lower triangular superregular matrices are useful for e.g., maximum distance separable convolutional codes as well as for (sequential)…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
Integer Linear Programming (ILP) has a broad range of applications in various areas of artificial intelligence. Yet in spite of recent advances, we still lack a thorough understanding of which structural restrictions make ILP tractable.…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…