Related papers: A combinatorial approach to nonlinear spectral gap…
A Newton--Kantorovich-type argument enables the a posteriori existence verification of a unique regular root near a computed approximation, purely from computable data. This framework allows for non-selfadjoint problems and extends the…
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…
We consider a random quantum channel obtained by taking a selection of $d$ independent and Haar distributed $N$ dimensional unitaries. We follow the argument of Hastings to bound the spectral gap in terms of eigenvalues and adapt it to give…
We introduce a fast Fourier spectral method for the spatially homogeneous Boltzmann equation with non-cutoff collision kernels. Such kernels contain non-integrable singularity in the deviation angle which arise in a wide range of…
We study regular inclusions of finite-dimensional von Neumann algebras from a matrix-theoretic perspective. To this end, we introduce a new combinatorial invariant of an inclusion, called the normalizer matrix, which encodes the structure…
The trichotomy between regular, semiregular, and strongly irregular boundary points for $p$-harmonic functions is obtained for unbounded open sets in complete metric spaces with a doubling measure supporting a $p$-Poincar\'e inequality,…
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…
We construct nontrivial deformations of the standard map which preserve the symplectic actions, respectively the Lyapunov exponents, of infinitely many periodic orbits accumulating to an invariant curve. The proof uses a resonant…
A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a…
The nonlinear Schroedinger model is a prototypical dispersive wave equation that features finite time blowup, either for supercritical exponents (for fixed dimension) or for supercritical dimensions (for fixed nonlinearity exponent). Upon…
We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically…
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
The paper contains further development of the idea of field quantization introduced in M. Czachor, J. Phys. A: Math. Gen. {\bf 33} (2000) 8081-8103. The formalism is extended to the relativistic domain. The link to the standard theory is…
For each $b \geq 5$ we construct a pair of cospectral $b$-regular graphs, where one has a perfect matching and the other one not. This solves a research problem posed by the third author at the 22nd British Combinatorial Conference.
In this paper we give a geometric condition which ensures that $(q,p)$-Poincar\'e-Sobolev inequalities are implied from generalized $(1,1)$-Poincar\'e inequalities related to $L^1$ norms in the context of product spaces. The concept of…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
Classification and regression in which the inputs are graphs of arbitrary size and shape have been paid attention in various fields such as computational chemistry and bioinformatics. Subgraph indicators are often used as the most…