Related papers: Automatic generation of vertices for the Schroedin…
In the prequel to this paper, we presented a systematic framework for processing spline spaces. In this paper, we take the results of that framework and provide a code generation pipeline that automatically generates efficient…
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…
We employ the chirally rotated Schr\"odinger functional ($\chi$SF) to study two-point fermion bilinear correlation functions used in the determination of $Z_{A,V,S,P,T}$ on a series of well-tuned ensembles. The gauge configurations, which…
We propose an optical lattice setup to investigate spin chains and ladders. Electric and magnetic fields allow us to vary at will the coupling constants, producing a variety of quantum phases including the Haldane phase, critical phases,…
Time-periodic driving like lattice shaking offers a low-demanding method to generate artificial gauge fields in optical lattices. We identify the relevant symmetries that have to be broken by the driving function for that purpose and…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
We discuss simulation strategies for the massless lattice Schwinger model with a topological term and finite chemical potential. The simulation is done in a dual representation where the complex action problem is solved and the partition…
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to…
A new algorithm is developed allowing the Monte Carlo study of a 1 + 1 dimensional theory in real time. The main algorithmic development is to avoid the explicit calculation of the Jacobian matrix and its determinant in the update process.…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
We introduce a decomposition of associative algebras into a tensor product of cyclic modules. This produces a means to encode a basis with logarithmic information and thus extends the reach of calculation with large algebras. Our technique…
We introduce a primitive computation problem in the free tridendriform algebra generated by one element which is a Hopf algebra based on Schroeder trees. We know a complex way to generate all of them. To understand it clearer, we want to…
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices…
We discuss the Schr\"odinger functional in lattice QCD with staggered fermions and relate it, in the classical continuum limit, to the Schr\"odinger functional regularized with Wilson fermions. We compute the strong coupling constant…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
A new method to compute observables at many values of the parameters \lambda for a model with lattice action {\cal{S}}(\phi, \lambda) is described. After fixing a reference set \lambda^r of parameters, a single simulation is carried out by…
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…
Given a_1,a_2,...,a_n in Z^d, we examine the set, G, of all non-negative integer combinations of these a_i. In particular, we examine the generating function f(z)=\sum_{b\in G} z^b. We prove that one can write this generating function as a…