相关论文: On the reconstruction problem for Pascal lines

Reconstructing a complete object from its parts is a fundamental problem in many scientific domains. The purpose of this article is to provide a systematic survey on this topic. The reassembly problem requires understanding the attributes…

We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…

We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in…

The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…

In this work, we present a novel approach for reconstructing shape point clouds using planar sparse cross-sections with the help of generative modeling. We present unique challenges pertaining to the representation and reconstruction in…

Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits.…

We view the reconstruction of CAD models in the boundary representation (B-Rep) as the detection of geometric primitives of different orders, i.e. vertices, edges and surface patches, and the correspondence of primitives, which are…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…

Our aim is to prove a Poncelet type theorem for a line configuration on the complex projective. More precisely, we say that a polygon with 2n sides joining 2n vertices A1, A2,..., A2n is well inscribed in a configuration Ln of n lines if…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…

We define the Pascal triangle of a discrete (gray scale) image as a pyramidal arrangement of complex-valued moments and we explore its geometric significance. In particular, we show that the entries of row k of this triangle correspond to…

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an undirected graph $G=(V,E)$ and two "object types"…

Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial problem motivated by RESTORED, a TCP modeling methodology that…

An $(n, k, d, \alpha, \beta, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store a file. For a file of total size $M$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes…

The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…

We consider the following configuration. Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$, and for each vertex $X$, let $H_X$ be the orthocenter of the triangle formed by the other three. Then…

Let $P$ be a partial latin square of prime order $p>7$ consisting of three cyclically generated transversals. Specifically, let $P$ be a partial latin square of the form: \[ P=\{(i,c+i,s+i),(i,c'+i,s'+i),(i,c''+i,s''+i)\mid 0 \leq i< p\} \]…

The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new…