Related papers: A proof of Pieri's formula using the generalized S…
We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called {\em star insertion problem} in the setting where the combinatorial embedding is fixed, and has several…
In this paper we generalize the Ball-Collision Algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and compare the asymptotic complexity to other generalized…
This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.
In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-graph versions of three famous single-source shortest…
We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…
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…
We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…
The purpose of this note is to give an insertion scheme proof of the formula, $$p_\mu = \sum_{\lambda\vdash k} \chi^\lambda(\mu)s_\lambda,\formula$$ where $p_\mu$ is the power sum symmetric function, $s_\lambda$ is the Schur function and…
We propose a general formalism of iterated random functions with semigroup property, under which exact and approximate Bayesian posterior updates can be viewed as specific instances. A convergence theory for iterated random functions is…
We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…
The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in…
Generalized permutahedra are a class of polytopes with many interesting combinatorial subclasses. We introduce pruned inside-out polytopes, a generalization of inside-out polytopes introduced by Beck--Zaslavsky (2006), which have many…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
We derive explicit Pieri-type multiplication formulas in the Grothendieck ring of a flag variety. These expand the product of an arbitrary Schubert class and a special Schubert class in the basis of Schubert classes. These special Schubert…
We develop the method of averaging in Clifford (geometric) algebras suggested by the author in previous papers. We consider operators constructed using two different sets of anticommuting elements of real or complexified Clifford algebras.…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
We consider the problem of counting the number of copies of a fixed graph $H$ within an input graph $G$. This is one of the most well-studied algorithmic graph problems, with many theoretical and practical applications. We focus on solving…
We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we apply the coupling method used for establishing threshold functions for homogeneous random intersection graphs introduced…