An official website of the United States government
Motivated by the open problem of large-data global existence for the non-cutoff Boltzmann equation, we introduce a model equation that in some sense disregards the anisotropy of the Boltzmann collision kernel. We refer to this model equation as isotropic Boltzmann by analogy with the isotropic Landau equation introduced by Krieger and Strain (2012) [35]. The collision operator of our isotropic Boltzmann model converges to the isotropic Landau collision operator under a scaling limit that is analogous to the grazing collisions limit connecting (true) Boltzmann with (true) Landau. Our main result is global existence for the isotropic Boltzmann equation in the space homogeneous case, for certain parts of the “very soft potentials” regime in which global existence is unknown for the space homogeneous Boltzmann equation. The proof strategy is inspired by the work of Gualdani and Guillen (2022) [22] on isotropic Landau, and makes use of recent progress on weighted fractional Hardy inequalities.
more »
« less
POTENTIALS OF A FROBENIUS-LIKE STRUCTURE
Abstract This paper proves the existence of potentials of the first and second kind of a Frobenius like structure in a frame, which encompasses families of arrangements. The frame uses the notion of matroids. For the proof of the existence of the potentials, a power series ansatz is made. The proof that it works requires that certain decompositions of tuples of coordinate vector fields are related by certain elementary transformations. This is shown with a nontrivial result on matroid partition.
more »
« less
- Award ID(s):
- 1665239
- PAR ID:
- 10054198
- Date Published:
- Journal Name:
- Glasgow Mathematical Journal
- ISSN:
- 0017-0895
- Page Range / eLocation ID:
- 1 to 13
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The goal of this paper is to provide new proofs of the persistence of superoscillations under the Schrödinger equation. Superoscillations were first put forward by Aharonov and have since received much study because of connections to physics, engineering, signal processing and information theory. An interesting mathematical question is to understand the time evolution of superoscillations under certain Schrödinger equations arising in physics. This paper provides an alternative proof of the persistence of superoscillations by some elementary convergence facts for sequence and series and some connections with certain polynomials and identities in combinatorics. The approach given opens new perspectives to establish persistence of superoscillations for the Schrödinger equation with more general potentials.more » « less
-
Abstract Magic angles in the chiral model of twisted bilayer graphene are parameters for which the chiral version of the Bistritzer–MacDonald Hamiltonian exhibits a flat band at energy zero. We compute the sums over powers of (complex) magic angles and use that to show that the set of magic angles is infinite. We also provide a new proof of the existence of the first real magic angle, showing also that the corresponding flat band has minimal multiplicity for the simplest possible choice of potentials satisfying all symmetries. These results indicate (though do not prove) a hidden integrability of the chiral model.more » « less
-
In 1983, Antontsev, Kazhikhov, and Monakhov published a proof of the existence and uniqueness of solutions to the 3D Euler equations in which on certain inflow boundary components fluid is forced into the domain while on other outflow components fluid is drawn out of the domain. A key tool they used was the linearized Euler equations in vorticity form. We extend their result on the linearized problem to multiply connected domains and establish compatibility conditions on the initial data that allow higher regularity solutions.more » « less
-
We study pure-strategy Nash equilibrium (PSNE) computation in 𝑘-dimensional congestion games (𝑘-DCGs) where the weights or demands of the players are 𝑘-dimensional vectors. We first show that deciding the existence of a PSNE in a 𝑘-DCG is NP-complete even for games when players have binary and unit demand vectors. We then focus on computing PSNE for 𝑘-DCGs and their variants with general, linear, and exponential cost functions. For general cost functions (potentially non-monotonic), we provide the first configuration-space framework to find a PSNE if one exists. For linear and exponential cost functions, we provide potential function-based algorithms to find a PSNE. These algorithms run in polynomial time under certain assumptions. We also study structured demands and cost functions, giving polynomial-time algorithms to compute PSNE for several cases. For general cost functions, we give a constructive proof of existence for an (𝛼, 𝛽)-PSNE (for certain 𝛼 and 𝛽), where 𝛼 and 𝛽 are multiplicative and additive approximation factors, respectively.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1017/S0017089517000374
