Related papers: An Algorithm for Computing Four-Ramond Vertices at…
In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can…
A new deterministic, numerical method to solve fermion field theories is presented. This approach is based on finding solutions $Z[J]$ to the lattice functional equations for field theories in the presence of an external source $J$. Using…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
Four-fermion operators may have large anomalous scaling and become relevant operators in some strongly interacting gauge theories. We present a detailed model which illustrates some of the implications of such operators for the generation…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…
Strongly non-Gaussian ensembles of large random matrices possessing unitary symmetry and logarithmic level repulsion are studied both in presence and absence of hard edge in their energy spectra. Employing a theory of polynomials orthogonal…
We revisit the Jordan-Wigner transformation, showing that --rather than a non-local isomorphism between different fermionic and spin Hamiltonian operators-- it can be viewed in terms of local identities relating different realizations of…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…
We provide a bottom up construction of torsion generators for weighted homology of a weighted complex over a discrete valuation ring $R=\mathbb{F}[[\pi]]$. This is achieved by starting from a basis for classical homology of the $n$-th…
In this thesis I develop a formalism whereby a tensor network may be understood in terms of a unitary braided tensor category, and represented in a particularly efficient manner corresponding to the exploitation of this mathematical…
To obtain a light mode in two-dimensional staggered fermions, we introduce four new local operators keeping the rotational invariance for a staggered Dirac operator. To split masses of tastes, three cases are considered. The mass matrix and…
We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A,…
We design and analyze a novel accelerated gradient-based algorithm for a class of bilevel optimization problems. These problems have various applications arising from machine learning and image processing, where optimal solutions of the two…
Semantic segmentation classifies each pixel in the image. Due to its advantages, semantic segmentation is used in many tasks, such as cancer detection, robot-assisted surgery, satellite image analysis, and self-driving cars. Accuracy and…
In this talk I discuss a new possibility for stochastic representation of the fe rmion determinant. The method can be used for global Monte Carlo fermion algorit hms and is tested in the case of the Schwinger model.
This paper presents a state-of-the-art algorithm for the vertex enumeration problem of arrangements, which is based on the proposed new pivot rule, called the Zero rule. The Zero rule possesses several desirable properties: i) It gets rid…
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essential that efficient algorithms be used…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…