相关论文: Short Proofs in Algebraic and Enumerative Combinat…

The outline of lattice simulations of $(2+1)D$ soliton-propagations in the background of Weyl spinors is presented. Clifford algebra is applied on Luescher's domain decomposition method. The Clifford algebra shows that there are loop parts…

We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…

In the framework of bulk reconstruction, we elucidate the relationship between the action of CFT modular Hamiltonians on bulk operators, the possible equation of motion for the bulk operators, and the charge distribution at infinity…

Based on the solution of \textbf{Paulsen Problem} by Kwok, Lau, Lee, and Ramachandran [\textit{STOC'18-Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018}] and independently by Hamilton, and Moitra…

Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

We study a question posed by Stephen Simons in his 2008 monograph involving "bigger conjugate" (BC) functions and the partial infimal convolution. As Simons demonstrated in his monograph, these function have been crucial to the…

In a 2016 ArXiv posting F. Bergeron listed a variety of symmetric functions $G[X;q]$ with the property that $G[X;1+q]$ is $e$-positive. A large subvariety of his examples could be explained by the conjecture that the Dyck path LLT…

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

Existence, uniqueness and stability of the solutions of linear stochastic evolution equations are investigated. The results obtained are used to prove theorems on solvability of linear second order stochastic partial differential equations…

We survey systematic approaches to basis-restricted fragments of propositional logic and modal logics, with an emphasis on how expressive power and computational complexity depend on the allowed operators. The propositional case is…

We consider faithful actions of simple algebraic groups on self-dual irreducible modules, and on the associated varieties of totally singular subspaces, under the assumption that the dimension of the group is at least as large as the…

Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…

Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field…

We study transport of algebraic structures and prove a theorem which subsumes results of Comfort and Ross on topological group structures on Stone-Cech compactifications, of Chevalley and of Gil de Lamadrid and Jans on topological group and…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

This note deals with two topics of linear algebra. We give a simple and short proof of the multiplicative property of the determinant and provide a constructive formula for rotations. The derivation of the rotation matrix relies on simple…

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.