Related papers: Using Symbolic Computation to Explore Generalized …
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
The complexity of Gr\"{o}bner computations has inspired many improvements to Buchberger's algorithm over the years. Looking for further insights into the algorithm's performance, we offer a threaded implementation of classical Buchberger's…
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…
Generating high-quality geometry problems is both an important and challenging task in education. Compared to math word problems, geometry problems further emphasize multi-modal formats and the translation between informal and formal…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
We propose a symbolic generative task description language and a corresponding inference engine capable of representing arbitrary multimodal tasks as structured symbolic flows. Unlike conventional generative models that rely on large-scale…
We describe a neural-based method for generating exact or approximate solutions to differential equations in the form of mathematical expressions. Unlike other neural methods, our system returns symbolic expressions that can be interpreted…
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…
We present an algorithm for the derivation of Dyson-Schwinger equations of general theories that is suitable for an implementation within a symbolic programming language. Moreover, we introduce the Mathematica package DoDSE which provides…
Learning general-purpose representations from perceptual inputs is a hallmark of human intelligence. For example, people can write out numbers or characters, or even draw doodles, by characterizing these tasks as different instantiations of…
A real quadratic matrix is generalized doubly stochastic (g.d.s.) if all of its row sums and column sums equal one. We propose numerically stable methods for generating such matrices having possibly orthogonality property or/and satisfying…
In an effort to further understanding $q,t$-Catalan statistics, a new statistic on Dyck paths called $\mathtt{depth}$ was proposed in Pappe, Paul and Schilling (2022) and was shown to be jointly equi-distributed with the well-known…
Around 2000, Ira Gessel conjectured that the number of lattice walks in the quadrant N^2, starting and ending at the origin (0,0) and taking their steps in {E,NE,W,SW} had a simple hypergeometric form. In the following decade, this problem…
Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing…
Dynkin's (Bull. Amer. Math. Soc. 3 (1980) 975-999) seminal work associates a multidimensional transient symmetric Markov process with a multidimensional Gaussian random field. This association, known as Dynkin's isomorphism, has profoundly…
Theoretical foundations of compositional reasoning about heaps in imperative programming languages are investigated. We introduce a novel concept of compositional symbolic memory and its relevant properties. We utilize these formal…
This study extends the use of symbolic computation in Matrix Structural Analysis (MSA) to plane (2D) trusses, building on previous work that focused on continuous beams. An open-source MATLAB program, hosted on GitHub, was developed to…
An analytic formulation of memory-possessing random walks introduced recently [Cressoni et al., Phys. Rev. Lett. 98, 070603 (2007) and Sch\"utz and Trimper, Phys. Rev. E 70, 045101 (2004)] for Alzheimer behavior and related phenomena is…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…