相关论文: Exhaustive generation of `Mrs Perkins's quilt' squ…

I formulate in a colour-friendly way the FKS method for the computation of QCD cross sections at the next-to-leading order accuracy. This is achieved through the definition of subtraction terms for squared matrix elements, constructed with…

The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…

We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…

We enumerate all dissections of an equilateral triangle into smaller equilateral triangles up to size 20, where each triangle has integer side lengths. A perfect dissection has no two triangles of the same side, counting up- and…

We introduce CUTS-GPR, a new method for performing numerically exact Gaussian process regression (GPR) in high-dimensional settings. The key component of CUTS-GPR is an extremely fast kernel matrix-vector product, which exhibits near-linear…

Exponentiating the hypergeometric series gives a recursion relation for integer sequences which are generalizations of conventional Bell numbers. The corresponding associated Stirling numbers of the second kind are also generated and…

After analyzing the 4x4 determinant of a matrix, a shortcut was obtained to find such a determinant. Similarly to the Sarrus method for 2x2 or 3x3 determinants, the method consists of laying 19 columns of size 4 each and adding and…

We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

Multicuts enable to conveniently represent discrete graphical models for unsupervised and supervised image segmentation, in the case of local energy functions that exhibit symmetries. The basic Potts model and natural extensions thereof to…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

With the recent emergence of mixed precision hardware, there has been a renewed interest in its use for solving numerical linear algebra problems fast and accurately. The solution of total least squares problems, i.e., solving $\min_{E,r}…

We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much larger than that of the genes. The key distinction between…

Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the…

A cutting sequence is a symbolic coding of a linear trajectory on a translation surface corresponding to the sequence of sides hit in a polygonal representation of the surface. We characterize cutting sequences in a regular hexagon with…

P. J. Federico used the term low-order for perfect squared squares with at most 28 squares in their dissection. In 2010 low-order compound perfect squared squares (CPSSs) were completely enumerated. Up to symmetries of the square and its…

Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees…