相关论文: Fully Packed Loops in a triangle: matchings, paths…

We calculate Wilson loops in lowest order of perturbation theory for triangular contours whose edges are circular arcs. Based on a suitable disentanglement of the relations between metrical and conformal parameters of the contours, the…

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

A new closed formula for the first order perturbation estimate of the mixed least squares-total least squares (MTLS) solution is presented. It is mathematically equivalent to the one by Zheng and Yang(Numer. Linear Algebra Appl. 2019;…

In this work, we study two natural generalizations of clique-width introduced by Martin F\"urer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], while for fusion-width (fw) we have a possibility to merge…

We study "tricolor percolation" on the regular tessellation of R^3 by truncated octahedra, which is the three-dimensional analog of the hexagonal tiling of the plane. We independently assign one of three colors to each cell according to a…

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…

Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…

The 2-matrix models can be defined in a setting more general than polynomial potentials, namely, the semiclassical matrix model. In this case, the potentials are such that their derivatives are rational functions, and the integration paths…

The pairing hierarchy of perfect pairing (PP), perfect quadruples (PQ) and perfect hextuples (PH) are sparsified coupled cluster models that are exact in a pairing active space for 2, 4, and 6 electron clusters, respectively. We describe…

The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to…

This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm in 1972. Let A be a finite set of points in R2, omega be a height function which lifts the vertices of A into R3. Every flip in…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

A line of hard spheres confined by a transverse harmonic potential, with hard walls at its ends, exhibits a variety of buckled structures as it is compressed longitudinally. Here we show that these may be conveniently observed in a rotating…

We introduce the problem EndOfPotentialLine and the corresponding complexity class EOPL of all problems that can be reduced to it in polynomial time. This class captures problems that admit a single combinatorial proof of their joint…

Let $T_{m,n}$ be toroidal square grid of size $m\times n$ and let both $m$ and $n$ be even. Let $P$ be a perfect matching of $T_{m,n}$ and let $D(P)$ be the cycle-rooted spanning forest of $P$ obtained by the generalized Temperley's…

We classify mobile Pauli stabilizer codes up to gapped interfaces and coarse-graining using the framework of algebraic $\mathrm{L}$-theory. We compare this classification with that of framed TQFTs, theories that arise naturally in the…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…