Related papers: Computations for symbolic substitutions
Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…
This paper is a review of concepts from graded commutative algebra with specific attention given to length and multiplicity. The author's motivation for this paper comes from the study of equivariant cohomology in algebraic topology where…
We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic…
Let $G=\left\langle S|R_{A}\right\rangle $ be a semigroup with generating set $ S$ and equivalences $R_{A}$ among $S$ determined by a matrix $A$. This paper investigates the complexity of $G$-shift spaces by yielding the topological…
We give an in depth analysis of the subwords of the Thue-Morse sequence. This allows us to prove that there are infinitely many injective primitive substitutions with Perron-Frobenius eigenvalue 2 that generate a symbolic dynamical system…
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be…
A prototype for an extensible interactive graphical term manipulation system is presented that combines pattern matching and nondeterministic evaluation to provide a convenient framework for doing tedious algebraic manipulations that so far…
Symbolic execution is a powerful technique for program analysis. However, it has many limitations in practical applicability: the path explosion problem encumbers scalability, the need for language-specific implementation, the inability to…
Let $G$ be a simple graph. We demonstrate a method for using $t$-admissible subgraphs of $G$ to determine the regularity of the $t$-th symbolic power of the cover ideal of $G$. As an application, we compute the regularity of powers of cover…
We suggest to endow Mumford's GIT quotient scheme with a stack structure, by replacing Proj(-) of the invariant ring with its stack theoretic analogue. We analyse the stacks resulting in this way from classically studied invariant rings,…
This paper wishes to foster communication between mathematicians and physicists working in mirror symmetry and orbifold Gromov-Witten theory. We provide a reader friendly review of the physics computation in [arXiv:hep-th/0607100] that…
Symbolic computation is an important approach in automated program analysis. Most state-of-the-art tools perform symbolic computation as interpreters and directly maintain symbolic data. In this paper, we show that it is feasible, and in…
The theory of Gauss diagrams and Gauss diagram formulas provides convenient ways to compute knot invariants, such as coefficients of the HOMFLYPT polynomial. In \cite{4,5}, the author uses Gauss diagram formulas to find combinatorial…
The subject of this paper is a simulation to that in [1] but here we consider substitutions corresponding to transpositions instead of replacements.
We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…
We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of {\pi}/n. We find new substitution rules admitting 7-fold rotational symmetry at many different…
We develop geometric superspace settings to construct arbitrary higher derivative couplings (including R^n terms) in three-dimensional supergravity theories with N=1,2,3 by realising them as conformal supergravity coupled to certain…
In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We give detailed descriptions of gluing pseudoholomorphic maps in symplectic geometry, especially in the presence of an obstruction bundle. The main motivation is to try to compare the symplectic and enumerative invariants of algebraic…