Related papers: Insertion algorithms for Gelfand $S_n$-graphs
We consider two partial orders on standard Young tableaux. The first one is induced from the weak right Bruhat order on symmetric group by Robinson-Schensted algorithm. The second one is induced from the order on Young diagrams by…
The Marcus-Spielman-Srivastava theorem (Annals of Mathematics, 2015) for the Kadison-Singer conjecture implies the following result in spectral graph theory: For any undirected graph $G = (V,E)$ with a maximum edge effective resistance at…
We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…
In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the complexity of embeddings between bi-embeddable structures…
This study develops an algorithm to reproduce reaction route maps (RRMs) in shape space from the outputs of potential search algorithms. To demonstrate this, GRRM is utilized as a potential search algorithm but the proposed algorithm should…
Intersection graphs are well-studied in the area of graph algorithms. Some intersection graph classes are known to have algorithms enumerating all unlabeled graphs by reverse search. Since these algorithms output graphs one by one and the…
Recent work has shown deep learning can accelerate the prediction of physical dynamics relative to numerical solvers. However, limited physical accuracy and an inability to generalize under distributional shift limit its applicability to…
In this paper, we introduce a method called graph fusion embedding, designed for multi-graph embedding with shared vertex sets. Under the framework of supervised learning, our method exhibits a remarkable and highly desirable synergistic…
For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…
This technical report is devoted to the continuous estimation of an epsilon-assignment. Roughly speaking, an epsilon assignment between two sets V1 and V2 may be understood as a bijective mapping between a sub part of V1 and a sub part of…
An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…
In the context of deformation quantization, there exist various procedures to deal with the quantization of a reduced space M_red. We shall be concerned here mainly with the classical Marsden-Weinstein reduction, assuming that we have a…
In arXiv:1506.05880 we gave a generalization of the theory of quivers with potentials introduced by Derksen-Weyman-Zelevinsky, via completed tensor algebras over $S$-bimodules where $S$ is a finite dimensional basic semisimple algebra. In…
Localization microscopy often relies on detailed models of point spread functions. For applications such as deconvolution or PSF engineering, accurate models for light propagation in imaging systems with high numerical aperture are…
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview of Risch's algorithm including recent developments. The algorithms discussed are suited for both indefinite and definite integration. They…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
The field of Graph Signal Processing (GSP) has proposed tools to generalize harmonic analysis to complex domains represented through graphs. Among these tools are translations, which are required to define many others. Most works propose to…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
For a graph $G$, let $\nu_s(G)$ be the induced matching number of $G$. We prove that $\nu_s(G) \geq \frac{n(G)}{(\lceil\frac{\Delta}{2}\rceil+1) (\lfloor\frac{\Delta}{2}\rfloor+1)}$ for every graph of sufficiently large maximum degree…