相关论文: Computer aided solution of the invariance equation…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…

The dilemma which remained unsolved using Rao-Stirling diversity, namely of how variety and balance can be combined into "dual concept diversity" (Stirling, 1998, pp. 48f.) can be clarified by using Nijssen et al.'s (1998) argument that the…

Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved. In this paper, we use a representation theoretic approach to solve the general…

We show that Pinney's equation [2] with a constant coefficient can be reduced to its linear part by a simple change of variables. Also, Pinney's original solution is simplified slightly.

We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed…

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

We give a combinatorial consistency-inconsistency configuration that is equivalent to the failure of the following form of Kim's lemma for a given $k$: $(\star)$ For any set of parameters $A$, formula $\varphi(x,b)$, and $A$-bi-invariant…

In this paper we examine the potential of computer-assisted proof methods to be applied much more broadly than commonly recognized. More specifically, we contend that there are vast opportunities to derive useful mathematical results and…

In this paper, we define the upper (resp. lower) covariance under multiple probabilities via a corresponding max-min-max (resp. min-max-min) optimization problem and the related properties of covariances are obtained. In particular, we…

The inequality is computed through the so-called Gini index. The population is assumed to have the variable of interest distributed according to the Gamma probability distribution. The results show that the Gini index is reduced when the…

We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…

We advance scale-invariance arguments for systems that are governed (or approximated) by a $q-$Gaussian distribution, i.e., a power law distribution with exponent $Q=1/(1-q); q \in \mathbb{R}$. The ensuing line of reasoning is then compared…

We generalize two embedding theorems and investigate the existence and multiplicity of nontrivial solutions for a $(p,q)$-Laplacian coupled system with perturbations and two parameters $\lambda_1$ and $\lambda_2$ on locally finite graph. By…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Erd\H{o}s and Graham define $g(n) = n + \phi(n)$ and the iterated application $g_k(n) = g(g_{k-1}(n))$. They ask for solutions of $g_{k+r}(n) = 2 g_{k}(n)$ and observe $g_{k+2}(10) = 2 g_{k}(10)$ and $g_{k+2}(94) = 2 g_{k}(94)$. We show…

The key indicators of model stability are the population stability index (PSI), which uses the difference in population distribution, and the Kolmogorov-Smirnov statistic (KS) between two distributions. When deriving a binary choice model,…

Virasoro-type symmetries and their roles in solvable models are reviewed. These symmetries are described by the two-parameter Virasoro-type algebra $Vir_{p,q}$ by choosing the parameters p and q suitably.

A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…