中文
相关论文

相关论文: Improvement on a Central Theory of PDEs

200 篇论文

We shall firstly study the existence of one positive solution of a model problem for one equation via the classical Krasnosel'ski\u\i{} fixed-point theorem. Secondly we investigate how to handle this problem via the fixed point index theory…

经典分析与常微分方程 · 数学 2017-12-08 Gennaro Infante

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

代数拓扑 · 数学 2010-07-09 John R. Klein , Bruce Williams

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

计算机科学中的逻辑 · 计算机科学 2022-01-11 Lev Gordeev

This thesis is about the study of Lie groupoids endowed with a compatible (multiplicative) differential 1-form. The motivation and scope of the present work is to study the geometry of PDEs using the formalism of Lie groupoids and…

微分几何 · 数学 2013-06-11 Maria Amelia Salazar

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

数论 · 数学 2024-12-17 George E. Andrews , Mohamed El Bachraoui

This paper contains a stronger version of a final identification theorem for the `generic' groups of finite Morley rank.

群论 · 数学 2011-11-28 Ayse Berkman , Alexandre Borovik

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

人工智能 · 计算机科学 2007-05-23 Bart Verheij

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

泛函分析 · 数学 2008-12-09 Geraldo Botelho , Daniel Pellegrino , Pilar Rueda

We introduce a class of group-like objects and prove that Cayley Theorem on groups has a counterpart in the class of group-like objects.

环与代数 · 数学 2007-05-23 Keqin Liu

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…

群论 · 数学 2010-08-02 D. Garber , S. Kaplan , M. Teicher , B. Tsaban , U. Vishne

We analyse some aspects of the notion of algebraic exponentiation introduced by the second author [16] and satisfied by the category of groups. We show how this notion provides a new approach to the categorical-algebraic question of the…

范畴论 · 数学 2011-12-20 Dominique Bourn , James R. A. Gray

Topos properties of the category of covering groupoids over a fixed groupoid are discussed. A classification result for connected covering groupoids over a fixed groupoid analogous to the fundamental theorem of Galois theory is given.

范畴论 · 数学 2007-05-23 Zhi-Ming Luo

We improve constants in the Rademacher-Menchov inequality.

概率论 · 数学 2007-05-23 Witold Bednorz

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

群论 · 数学 2022-12-16 Hiranya Kishore Dey

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

综合数学 · 数学 2015-01-14 Konstantinos N. Gaitanas

We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class \np, and imply that computing approximate solutions to many \np-hard problems is itself \np-hard. Techniques developed to…

计算复杂性 · 计算机科学 2008-12-15 Sanjeev Arora

The fundamental elements of evidential reasoning problems are described, followed by a discussion of the structure of various types of problems. Bayesian inference networks and state space formalism are used as the tool for problem…

人工智能 · 计算机科学 2013-04-12 Moshe Ben-Bassat

Decision theories offer principled methods for making choices under various types of uncertainty. Algorithms that implement these theories have been successfully applied to a wide range of real-world problems, including materials and drug…

机器学习 · 计算机科学 2026-05-26 Agustinus Kristiadi

Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each…

机器学习 · 统计学 2014-12-03 Arto Klami , Seppo Virtanen , Eemeli Leppäaho , Samuel Kaski

Partial differential equations with discrete (concentrated) state-dependent delays are studied. The existence and uniqueness of solutions with initial data from a wider linear space is proven first and then a subset of the space of…

偏微分方程分析 · 数学 2010-11-11 Alexander V. Rezounenko , Petr Zagalak