Related papers: Algorithmic correspondence and analytic rules
Stochastic approximation (SA) algorithms have been widely applied in minimization problems when the loss functions and/or the gradient information are only accessible through noisy evaluations. Stochastic gradient (SG) descent---a…
Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
We present the system G3S5, a Gentzen-style sequent calculus system for the modal propositional logic S5, which in a sense has the subformula property. We formulate the rules of G3 S5 in the system G3S5; which has the subformula property…
In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation. The formula contains…
Let $\mathcal{C}$ be an additive category equipped with an automorphism $\Sigma$. We show how to obtain $n$-angulations of $(\mathcal{C},\Sigma)$ using some particular periodic injective resolutions. We give necessary and sufficient…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
In a companion paper (hereafter referred to as Paper I), we have presented an attempt to derive the finite-dimensional abstract quantum formalism from a set of physically comprehensible assumptions. In this paper, we formulate a…
We propose an algorithm to impute and forecast a time series by transforming the observed time series into a matrix, utilizing matrix estimation to recover missing values and de-noise observed entries, and performing linear regression to…
We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…
In this paper, we prove the existence of an efficient algorithm for the computation of $q$-expansions of modular forms of weight $k$ and level $\Gamma$, where $\Gamma \subseteq SL_{2}({\mathbb{Z}})$ is an arbitrary congruence subgroup. We…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
The analyticity properties of the S matrix in the physical region are determined by the correspondence principle, which asserts that the predictions of classical physics are generated by taking the classical limit of the predictions of…
In a previous work (arXiv:2505.05574), a summation formula for harmonic Maass forms of polynomial growth was established. In this note, we use the theory of $L$-series of harmonic Maass forms to state and prove a summation formula for such…
We present an extended morphometric system to automatically classify galaxies from astronomical images. The new system includes the original and modified versions of the CASGM coefficients (Concentration $C_1$, Asymmetry $A_3$, and…
Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived.…
We show that the model of quantum computation based on density matrices and superoperators can be decomposed in a pure classical (functional) part and an effectful part modeling probabilities and measurement. The effectful part can be…
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial…
We introduce a novel multiobjective optimization algorithm based on the conformational space annealing (CSA) algorithm, MOCSA. It has three characteristic features: (a) Dominance relationship and distance between solutions in the objective…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…