相关论文: Von Neumann-Steinhaus decomposition of parallelepi…

We show that trapezoids with identical Neumann spectra are congruent up to rigid motions of the plane. The proof is based on heat trace invariants and some new wave trace invariants associated to certain diffractive billiard trajectories.…

Techniques are developed for decoupling dissipative differential equations. The approach considered is based upon obtaining a sufficient gap in the time dependent linear portion of the equation that corresponds to the linear variational…

Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…

The paper continues the analysis, started in [1] (Part I,arXiv:2302.04353), of the model open wave-guide problem defined by 2 semi-infinite, rectangular wave-guides meeting along a common perpendicular line. In Part I we reduce the solution…

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…

The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We determine, with an exception of two cases, the complexity of the…

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…

The Linearization Theorem for proper Lie groupoids organizes and generalizes several results for classic geometries. Despite the various approaches and recent works on the subject, the problem of understanding invariant linearization…

An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…

We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…

Based on the definition of Riemann definite integral,deleting items and disturbing mesh theorems on Riemann sums are given. After deleting some items or disturbing the mesh of partition, the limit of Riemann sums still converges to Riemann…

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

Split decomposition of graphs was introduced by Cunningham (under the name join decomposition) as a generalization of the modular decomposition. This paper undertakes an investigation into the algorithmic properties of split decomposition.…

The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…

We classify tuples of (not necessarily commuting) isometries that admit von Neumann-Wold decomposition. We introduce the notion of twisted isometries for tuples of isometries and prove the existence of orthogonal decomposition for such…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the…

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…

The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity on planar graphs as well as on graphs of bounded degree. We…

In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and…