相关论文: On the reconstruction problem for Pascal lines
It is a classical result that any finite tree with positively weighted edges, and without vertices of degree 2, is uniquely determined by the weighted path distance between each pair of leaves. Moreover, it is possible for a (small) strict…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We describe the geometry of an arrangement of 24-cells inscribed in the 600-cell. In $\S$7 we apply our results to the even unimodular lattice $E_8$ and show how the 600-cell transforms $E_8$/2$E_8$, an 8-space over the field $\bf{F}$$_2$,…
We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field…
Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when $f$ of the $n$ particles have crashed. We focus on the basic line…
A path partition (also referred to as a linear forest) of a graph $G$ is a set of vertex-disjoint paths which together contain all the vertices of $G$. An isolated vertex is considered to be a path in this case. The path partition…
We consider the integer point transform $\sigma _P (\mathbf{x}) = \sum _{\mathbf{m} \in P\cap \mathbb{Z}^n} \mathbf{x}^\mathbf{m} \in \mathbb C [x_1^{\pm 1},\ldots, x_n^{\pm 1}]$ of a polytope $P\subset \mathbb{R}^n$. We show that if $P$ is…
This paper concerns the reconstruction of possibly complex-valued coefficients in a second-order scalar elliptic equation posed on a bounded domain from knowledge of several solutions of that equation. We show that for a sufficiently large…
We prove general results which include classical facts about 60 Pascal's lines as special cases. Along similar lines we establish analogous results about configurations of 2520 conics arising from Mystic Octagon. We offer a more…
In the past 20 years, the enumeration of plane lattice walks confined to a convex cone -- normalized into the first quadrant -- has received a lot of attention, stimulated the development of several original approaches, and led to a rich…
In this paper, we consider a transformation of $k$ disjoint paths in a graph. For a graph and a pair of $k$ disjoint paths $\mathcal{P}$ and $\mathcal{Q}$ connecting the same set of terminal pairs, we aim to determine whether $\mathcal{P}$…
We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructibility of tournaments up to 13 vertices, digraphs…
We determine the possible even sets of nodes on sextic surfaces in $\Pn 3$, showing in particular that their cardinalities are exactly the numbers in the set $\{24, 32, 40, 56 \}$. We also show that all the possible cases admit an explicit…
For $f(x)$ a separable polynomial of degree $d$ over a discretely valued field $K$, we describe how the cluster picture of $f(x)$ over $K$, in other words the set of tuples $\{(\mathrm{ord}(x_i-x_j),i,j) : 1\leq i< j \leq d \}$ where…
We derive some, seemingly new, curious additive relations in the Pascal triangle. They arise in summing up the numbers in the triangle along some vertical line up to some place.
A pseudoline is a homeomorphic image of the real line in the plane so that its complement is disconnected. An arrangement of pseudolines is a set of pseudolines in which every two cross exactly once. A drawing of a graph is pseudolinear if…
We give a simple presentation of the six quaternionic equiangular lines in $\mathbb{H}^2$ as an orbit of the primitive quaternionic reflection group of order 720 (which is isomorphic to 2.A_6 the double cover of $A_6)$. Other orbits of this…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
We show that the $n$'th diagonal sum of Barry's modified Pascal triangle can be described as the continuant of the run lengths of the binary representation of $n$. We also obtain an explicit description for the row sums.
The original Calder\'on problem consists in recovering the potential (or the conductivity) from the knowledge of the related Neumann to Dirichlet map (or Dirichlet to Neumann map). Here, we first perturb the medium by injecting small-scaled…