Related papers: Fully Packed Loops in a triangle: matchings, paths…
We describe a new conjecture involving Fully Packed Loop counting which relates recent observations of Thapper to formulae in the Temperley--Lieb model of loops, and how it implies the Razumov--Stroganov conjecture.
Littlewood--Paley theory is a fundamental tool for frequency localization, square-function control, and multiplier analysis, yet a systematic counterpart in the fractional Fourier transform (FrFT) setting has remained incomplete. We develop…
By means of numerical simulations we investigate the configurational properties of densely and fully packed configurations of loops in the negative-weight percolation (NWP) model. In the presented study we consider 2d square, 2d honeycomb,…
Twisted generalized Reed-Solomon (TGRS) codes are an extension of the generalized Reed-Solomon (GRS) codes by adding specific twists, which attract much attention recently. This paper presents an in-depth and comprehensive investigation of…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…
As minimum feature size and pitch spacing further decrease, triple patterning lithography (TPL) is a possible 193nm extension along the paradigm of double patterning lithography (DPL). However, there is very little study on TPL layout…
The Theory of Functional Connections (TFC) is a functional interpolation framework founded upon the so-called constrained expression: a functional that expresses the family of all possible functions that satisfy some user-specified, linear…
Perfectly matched layers (PMLs) are formulated and applied to numerically solve nonlocal Helmholtz equations in one and two dimensions. In one dimension, we present the PML modifications for the nonlocal Helmholtz equation with general…
Totally symmetric self-complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well-known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in one-twelfth of…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
Pattern learning in an important problem in Natural Language Processing (NLP). Some exhaustive pattern learning (EPL) methods (Bod, 1992) were proved to be flawed (Johnson, 2002), while similar algorithms (Och and Ney, 2004) showed great…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
One-ports named "f-circuits", composed of similar conductors described by a monotonic polynomial, or quasi-polynomial (i.e. with positive but not necessarily integer, powers) characteristic i = f(v) are studied, focusing on the algebraic…
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…
We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
The Flow Refueling Location Problem (FRLP) is a stylized model for determining the optimal placement of refueling stations for vehicles with limited travel ranges, such as hydrogen fuel cell vehicles and electric vehicles. A notable…