English
Related papers

Related papers: The interpolant existence problem for weak K4 and …

200 papers

The problem of existence of solutions to nabla differential equations and nabla differential inclusions on time scales is considered. Under a special form of the set-valued constraint map, sufficient conditions for the existence of at least…

Classical Analysis and ODEs · Mathematics 2012-07-23 Ewa Girejko , Delfim F. M. Torres

A mathematical model for collision-induced breakage is considered. Existence of weak solutions to the continuous nonlinear collision-induced breakage equation is shown for a large class of unbounded collision kernels and daughter…

Analysis of PDEs · Mathematics 2021-10-05 Ankik Kumar Giri , Philippe Laurençot

We investigate rough differential equations with a time-dependent reflecting lower barrier, where both the driving (rough) path and the barrier itself may have jumps. Assuming the driving signals allow for Young integration, we provide…

Probability · Mathematics 2021-09-21 Andrew L. Allan , Chong Liu , David J. Prömel

We extend Newton and Lagrange interpolation to arbitrary dimensions. The core contribution that enables this is a generalized notion of non-tensorial unisolvent nodes, i.e., nodes on which the multivariate polynomial interpolant of a…

Numerical Analysis · Mathematics 2024-04-17 Michael Hecht , Krzysztof Gonciarz , Jannik Michelfeit , Vladimir Sivkin , Ivo F. Sbalzarini

In this article we study the estimation of bifurcation coefficients in nonlinear branching problems by means of Rayleigh-Ritz approximation to the eigenvectors of the corresponding linearized problem. It is essential that the approximations…

Spectral Theory · Mathematics 2009-03-05 W. M. Greenlee , L. Hermi

In this paper, we critically examine Deng's "P=NP" [Den24]. The paper claims that there is a polynomial-time algorithm that decides 3-coloring for graphs with vertices of degree at most 4, which is known to be an NP-complete problem. Deng…

Computational Complexity · Computer Science 2025-07-15 Isabel Humphreys , Matthew Iceland , Harry Liuson , Dylan McKellips , Leo Sciortino

We consider the game-theoretic approach to time-inconsistent stopping of a one-dimensional diffusion where the time-inconsistency is due to the presence of a non-exponential (weighted) discount function. In particular, we study (weak)…

Probability · Mathematics 2022-07-01 Andi Bodnariu , Sören Christensen , Kristoffer Lindensjö

We present a Hermite interpolation problem via splines of odd-degree which, to the best knowledge of the authors, has not been considered in the literature on interpolation via odd-degree splines. In this new interpolation problem, we…

Statistics Theory · Mathematics 2007-06-13 Fadoua Balabdaoui , Jon A. Wellner

In this article, we prove the existence of at least two positive weak solutions for a mixed local-nonlocal singular problem in the presence of critical exponential nonlinearity in dimension two. The novelty of this work is the inclusion of…

Analysis of PDEs · Mathematics 2025-03-12 Sanjit Biswas

Reasoning with minimal models has always been at the core of many knowledge representation techniques, but we still have only a limited understanding of this problem in Description Logics (DLs). Minimization of some selected predicates,…

Artificial Intelligence · Computer Science 2025-08-08 Federica Di Stefano , Quentin Manière , Magdalena Ortiz , Mantas Šimkus

We study a coupled kinetic-non-Newtonian fluid system on the periodic domain ${\mathbb T}^3$, where particles evolve by a Vlasov equation and interact with an incompressible power-law fluid through a drag force. We prove the global…

Analysis of PDEs · Mathematics 2025-08-22 Young-Pil Choi , Jinwook Jung , Aneta Wróblewska-Kamińska

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…

Multiagent Systems · Computer Science 2026-03-03 Timotheus Kampik , Xiang Yin , Nico Potyka , Francesca Toni

We prove existence of global weak solutions for the Nernst-Planck-Poisson problem which describes the evolution of concentrations of charged species $X_1, ..., X_P$ subject to Fickian diffusion and chemical reactions in the presence of an…

Analysis of PDEs · Mathematics 2016-04-01 Dieter Bothe , André Fischer , Michel Pierre , Guillaume Rolland

We generalize the approach of Carlier (2001) and provide an existence proof for the multidimensional screening problem with general nonlinear preferences. We first formulate the principal's problem as a maximization problem with…

Econometrics · Economics 2018-12-11 Kelvin Shuangjian Zhang

In this paper we study the Cauchy problem for one multidimensional compressible nonlocal model of the dissipative quasi-geostrophic equations. First, we obtain the local existence and uniqueness of the smooth non-negative solution or the…

Analysis of PDEs · Mathematics 2012-02-07 Shu Wang , Li Linrui , Shengtao Chen

IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this note, we resolve the question and prove that, contrary to…

Discrete Mathematics · Computer Science 2015-06-30 Lukáš Folwarczný , Dušan Knop

In this paper, we investigate the existence of weak solutions for a class of degenerate elliptic Dirichlet problems with critical nonlinearity and a logarithmic perturbation

Analysis of PDEs · Mathematics 2024-05-20 Hua Chen , Xin Liao , Ming Zhang

Let C subset Reg be a non-empty class (of regular cardinal). Then the logic L(Q^{cf}_C) has additional nice properties: it has homogeneous model existence property.

Logic · Mathematics 2009-02-04 Saharon Shelah

We have recently presented a general method of proving the fundamental logical properties of Craig and Lyndon Interpolation (IPs) by induction on derivations in a wide class of internal sequent calculi, including sequents, hypersequents,…

Logic in Computer Science · Computer Science 2023-08-01 Roman Kuznets

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Logic in Computer Science · Computer Science 2026-02-02 Amirhossein Akbar Tabatabai , Raheleh Jalali
‹ Prev 1 8 9 10 Next ›