相关论文: Quantifier Elimination for Normal Cone Computation…
We derive formulas for the efficiency correction of cumulants with many efficiency bins. The derivation of the formulas is simpler than the previously suggested method, but the numerical cost is drastically reduced from the naive method.…
Small regularizers can preserve linear programming solutions exactly. This paper provides the first average-case analysis of exact regularization: with a standard Gaussian cost vector and fixed constraint set, bounds are established for the…
In this paper, we give appropriate languages in which the theory of tame fields (of any characteristic) admits (relative) quantifier elimination.
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
Using linear algebra methods we study certain algebraic properties of monomial rings and matroids. Let I be a monomial ideal in a polynomial ring over an arbitrary field. If the Rees cone of I is quasi-ideal, we express the normalization of…
This paper presents a way of formalising definite descriptions with a binary quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $\iota$ in a system of intuitionist negative free…
We propose an efficient method to compute a small set of integer-constrained cone singularities, which induce a rotationally seamless conformal parameterization with low distortion. Since the problem only involves discrete variables, i.e.,…
We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…
We consider the Quantifier Elimination (QE) problem for propositional CNF formulas with existential quantifiers. QE plays a key role in formal verification. Earlier, we presented an approach based on the following observation. To perform…
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…
Recently \cite{Horowitz:2022rpp,Horowitz:2022uak}, denominator regularisation (Den. Reg.) scheme has been proposed to handle divergences in quantum field theory. It is shown to yield results as simple as in dimensional regularisation scheme…
In this paper, we study the equality constrained nonlinear least squares problem, where the Jacobian matrices of the objective function and constraints are unavailable or expensive to compute. We approximate the Jacobian matrices via…
The procedure of the "quantum" linearization of the Hamiltonian ordinary differential equations with one degree of freedom is introduced. It is offered to be used for the classification of integrable equations of the Painleve type. By this…
Termination of logic programs with negated body atoms (here called general logic programs) is an important topic. One reason is that many computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's…
A reliable method for characterizing quantum operations that is suitable for improving and validating their accuracies is indispensable for realizing a practical quantum computer. Known methods are still not sufficient because they lack…
A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over…
Classification may not be reliable for several reasons: noise in the data, insufficient input information, overlapping distributions and sharp definition of classes. Faced with several possibilities neural network may in such cases still be…
Reduction operators of generalized Burgers equations are studied. A connection between these equations and potential fast diffusion equations with power nonlinearity -1 via reduction operators is established. Exact solutions of generalized…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…