相关论文: Curing the Andrews syndrom
Binary observations are often repeated to improve data quality, creating technical replicates. Several scoring methods are commonly used to infer the actual individual state and obtain a probability for each state. The common practice of…
Mechanized theorem proving is becoming the basis of reliable systems programming and rigorous mathematics. Despite decades of progress in proof automation, writing mechanized proofs still requires engineers' expertise and remains labor…
Two-sample tests for multivariate data and non-Euclidean data are widely used in many fields. Parametric tests are mostly restrained to certain types of data that meets the assumptions of the parametric models. In this paper, we study a…
In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
We systematically exploit a new generalized hypergeometric identity to obtain new hypergeometric summation formulas. As a consistency test, alternative proofs for some special cases are also provided. As a byproduct new summation formulas…
This paper deals with a hybrid joint diagonalization (JD) problem considering both Hermitian and transpose congruences. Such problem can be encountered in certain non-circular signal analysis applications including blind source separation.…
Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…
By combining classical techniques together with two novel asymptotic identities contained in [FL], we analyse certain single sums of Riemann-zeta type. In addition, we analyse Euler-Zagier double exponential sums for particular values of…
We propose two geometric versions of the bounded reduction property and find conditions for them to coincide. In particular, for the natural automatic structure on a hyperbolic group, the two notions are equivalent. We study endomorphisms…
This paper explores the relationship of artificial intelligence to the task of resolving open questions in mathematics. We first present an updated version of a traditional argument that limitative results from computability and complexity…
The current investigations on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent…
This work presents a novel technique that integrates the methodologies of machine learning and system identification to solve multiclass problems. Such an approach allows to extract and select sets of representative features with reduced…
We improve the complex number identity proving method to a fully automated procedure, based on elimination ideals. By using declarative equations or rewriting each real-relational hypothesis $h_i$ to $h_i-r_i$, and the thesis $t$ to $t-r$,…
In this paper we study an autocorrelation inequality proposed by Barnard and Steinerberger. The study of these problems is motivated by a classical problem in additive combinatorics. We establish the existence of extremizers to this…
We outline basic principles of a new method that gives a conceptual reasoning for and, at the same time, proofs of (super)congruences for truncated sums of arithmetic hypergeometric evaluations.
Formal methods apply algorithms based on mathematical principles to enhance the reliability of systems. It would only be natural to try to progress from verification, model checking or testing a system against its formal specification into…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
An attempt of a new kind of complexity anthropology is considered.
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…