Related papers: An unexpected application of minimization theory t…
The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…
We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
We provide a generalization of the normal mode decomposition for non-symmetric or locality constrained situations. This allows for instance to locally decouple a bipartitioned collection of arbitrarily correlated oscillators up to…
Blowing up a rational surface singularity in a reflexive module gives a (any) partial resolution dominated by the minimal resolution. The main theorem shows how deformations of the pair (singularity, module) relates to deformations of the…
In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory $\mathcal{T}_0$ with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which…
We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.
Extending the idea of Even and Lehrer [3], we discuss a general approach to integration based on a given decomposition system equipped with a weighting function, and a decomposition of the integrated function. We distinguish two type of…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
After attaching explicitly to the M\"obius strip an invertible module over the ring of real polynomial functions on the real circle, we expound as directly as possible the many faces and the main algebraic properties of invertible modules.…
We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program…
This is a brief report on a particular use of measurement-based uncomputation. Though not appealing in performance, it may shed light on optimization techniques in various quantum circuits.
The aim of this paper is to propose a strategy to implement the Minimal Model Program in modern computer algebra systems.
We introduce and discuss the concept of modular entanglement. This is the entanglement that is established between the end points of modular systems composed by sets of interacting moduli of arbitrarily fixed size. We show that end-to-end…
We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…