Related papers: Embedding partial Steiner triple systems with few …
Let $\{p_1,\dots,p_n\}$ and $\{q_1,\dots,q_n\}$ be two sets of $n$ labeled points in general position in the plane. We say that these two point sets have the same order type if for every triple of indices $(i,j,k)$, $p_k$ is above the…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…
We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…
Let us consider a case where all of the elements in some continuous slices are missing in tensor data. In this case, the nuclear-norm and total variation regularization methods usually fail to recover the missing elements. The key problem…
In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to…
We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
This work explores the extent to which LSB embedding can be made secure against structural steganalysis through a modification of cover image statistics prior to message embedding. Natural images possess symmetries that are expressed…
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…
Minimal obstructions for embedding 4-regular Eulerian digraphs on the plane are considered in relation to the partial order defined by the cycle removal operation. Their basic properties are provided and all obstructions with parallel arcs…
Given a Stein manifold X of dimension n>1, a discrete sequence a_j in X, and a discrete sequence b_j in C^m where m > [3n/2], there exists a proper holomorphic embedding of X into C^m which sends a_j to b_j for every j=1,2,.... This is the…
While modern general-purpose computing systems have ample amounts of memory, it is still the case that embedded computer systems, such as in a refrigerator, are memory limited; hence, such embedded systems motivate the need for strictly…
A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…
This paper is concerned with the theory, construction and application of implicit Peer two-step methods that are super-convergent for variable stepsizes, i.e., preserve their classical order achieved for uniform stepsizes when applied to…
Measurements in very low disorder two-dimensional electrons confined to relatively wide GaAs quantum well samples with tunable density reveal reentrant $\nu=1$ integer quantum Hall states in the lowest Landau level near filling factors…
Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…