Related papers: Relating Edelman-Greene insertion to the Little ma…
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
The classical Robinson--Schensted--Knuth correspondence is a bijection from nonnegative integer matrices to pairs of semi-standard Young tableaux. Based on the work of, among others, Burge, Hillman, Grassl, Knuth and Gansner, it is known…
In the symmetric group $S_n$, each element $\sigma$ has an associated cycle type $\alpha$, a partition of $n$ that identifies the conjugacy class of $\sigma$. The Robinson-Schensted (RS) correspondence links each $\sigma$ to another…
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…
In this paper, the Green's function and decomposition technique is proposed for solving the coupled Lane-Emden equations. This approach depends on constructing Green's function before establishing the recursive scheme for the series…
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the…
A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism group of a Klein surface and a Smarandache manifold,…
The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…
There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
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…
Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
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…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters $q$…
We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we…
We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we…