Related papers: Modifying partition functions: a way to solve the …
We consider the problem of unconstrained minimization of finite sums of functions. We propose a simple, yet, practical way to incorporate variance reduction techniques into SignSGD, guaranteeing convergence that is similar to the full sign…
The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…
We show that solutions to fermion sign problems in the CT-INT formulation can be extended to systems involving fermions interacting with dynamical quantum spins. While these sign problems seem unsolvable in the auxiliary field approach,…
In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…
The n-way number partitioning problem, a fundamental challenge in combinatorial optimization, has significant implications for applications such as fair division and machine scheduling. Despite these problems being NP-hard, many…
Properties of partial integrals such as real and complex-valued polynomial, multiple polynomial, exponential, and conditional for ordinary differential systems are studied. The possibilities of constructing first integrals and last…
The numerical sign problem has long been a major obstacle to first-principles calculations in various important fields of physics. We report that the recently proposed algorithm, tempered Lefschetz thimble method (TLTM), and its worldvolume…
This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…
Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just…
If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…
We address the problem of the minus sign sampling for two electron systems using the path integral approach. We show that this problem can be reexpressed as one of computing free energy differences and sampling the tails of statistical…
The sign problem is one of the central obstacles to efficiently simulating quantum many-body systems. It is commonly believed that some phases of matter, such as the double semion model, have an intrinsic sign problem and can never be…
The main purpose of this paper is using a very simple constructive method to study an old number theory problem related to the Legendre symbol modulo p, and completely solved it. The proving method of the result is purely elementary and has…
In this article we study the existence of sign changing solution of the following p-fractional problem with concave-critical nonlinearities: \begin{eqnarray*} (-\Delta)^s_pu &=& \mu |u|^{q-1}u + |u|^{p^*_s-2}u \quad\mbox{in}\quad \Omega,…
An explicit perturbative solution to all orders is given for a general class of nonlinear differential equations. This solution is written as a sum indexed by rooted trees and uses the Green function of a linearization of the equations. The…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
For more than a decade, graphs have been used to model the voting behavior taking place in parliaments. However, the methods described in the literature suffer from several limitations. The two main ones are that 1) they rely on some…
Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…
In this paper we present an alternative approach to symbolic segmentation; instead of implementing a new method we approach symbolic segmentation as an algorithm selection problem. That is, let there be $n$ available algorithms for symbolic…