Related papers: Notes on color reductions and $\gamma$ traces
An approximate technique for performing nonperturbative calculations in quantum SU(3) gauge theory is presented. One aspect of this nonperturbative method is the breaking down $SU(3) \to SU(2) + coset$. The procedure also uses some aspects…
Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for…
In this paper, we develop a numerical algorithm for an inverse problem on determining fractional orders of time derivatives simultaneously in a coupled subdiffusion system. Following the theoretical uniqueness, we reformulate the order…
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The…
We develop a non-perturbative formulation based on the Green-function quantization method, that can describe spontaneous parametric down-conversion in the high-gain regime in nonlinear optical structures with arbitrary amount of loss and…
We suggest a new algorithm to remove systematic effects in a large set of lightcurves obtained by a photometric survey. The algorithm can remove systematic effects, like the ones associated with atmospheric extinction, detector efficiency,…
Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for such algorithms and provide a detailed analysis of the…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
We introduce a novel self-attention mechanism, which we call CSA (Chromatic Self-Attention), which extends the notion of attention scores to attention _filters_, independently modulating the feature channels. We showcase CSA in a…
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…
The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…
Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…
We present three sublinear randomized algorithms for vertex-coloring of graphs with maximum degree $\Delta$. The first is a simple algorithm that extends the idea of Morris and Song to color graphs with maximum degree $\Delta$ using…
We use the method of the Weingarten functions to evaluate SU(N) integrals of the polynomial type. As an application we calculate various one-link integrals for lattice gauge and spin SU(N) theories.
Mixtures of Gaussian factors are powerful tools for modeling an unobserved heterogeneous population, offering - at the same time - dimension reduction and model-based clustering. Unfortunately, the high prevalence of spurious solutions and…
A numerical algorithm for studying strongly correlated electron systems is proposed. The groundstate wavefunction is projected out after numerical renormalization procedure in the path integral formalism. The wavefunction is expressed from…
We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…
Recently a permutation on Dyck paths, related to the chip firing game, was introduced and studied by Barnabei et al.. It is called $\gamma$-operator, and uses symmetries and reflections to relate Dyck paths having the same length. A…
I gently introduce the diagrammatic birdtrack notation, first for vector algebra and then for permutations. After moving on to general tensors I review some recent results on Hermitian Young operators, gluon projectors, and multiplet bases…
In this paper, we give a precise definition of the analytic $\gamma$-factors of irreducible representations of quaternionic unitary groups, which extends a work of Lapid-Rallis.