Related papers: A proof of Pieri's formula using the generalized S…
We establish several contraction formulas for Kirchhoff index. We relate Kirchhoff index with some other metrized graph invariants. By applying our contraction formulas successively when the graph is a tree, we derive new formulas for…
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim., 34 (2024), pp. 1569-1594] by Bredies, Chenchene and Naldi. We particularize it to the case where…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…
By using the method in [5], the aim of the present note is to generalize the Riemann integral in probability introduced in [7], to Kurzweil-Henstock integral in probability. Properties of the new integral are proved.
An algorithm for the reduction of massive Feynman integrals with any number of loops and external momenta to a minimal set of basic integrals is proposed. The method is based on the new algorithm for evaluating tensor integrals,…
In this paper we give a generalization of a result of Wei.
Scaled relative graphs were recently introduced to analyze the convergence of optimization algorithms using two dimensional Euclidean geometry. In this paper, we connect scaled relative graphs to the classical theory of input/output…
We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.
In this paper we introduce the notion of generalized Lie algebroid and we develop a new formalism necessary to obtain a new solution for the Weistein's Problem. Many applications emphasize the importance and the utility of this new…
We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
We give the first two-dimensional pictorial presentation of Berele's correspondence \cite{Berele}, an analogue of the Robinson-Schensted (R-S) correspondence \cite{Robinson, Schensted} for the symplectic group $Sp(2n, \Cpx )$. From the…
In this paper we present distributed testing algorithms of graph properties in the CONGEST-model [Censor-Hillel et al. 2016]. We present one-sided error testing algorithms in the general graph model. We first describe a general procedure…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
In this paper we present a unifying framework for continuous optimization methods grounded in the concept of generalized convexity. Utilizing the powerful theory of $\Phi$-convexity, we propose a conceptual algorithm that extends the…
Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures,…
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software…
In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…