中文
相关论文

相关论文: An affirmative answer to a problem posed by Zaline…

200 篇论文

We establish a Positive Mass Theorem for initial data sets of the Einstein equations having generalized trapped surface boundary. In particular we answer a question posed by R. Wald concerning the existence of generalized apparent horizons…

微分几何 · 数学 2015-05-14 Marcus A. Khuri

New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and…

度量几何 · 数学 2014-12-01 Astrid Berg , Lukas Parapatits , Franz E. Schuster , Manuel Weberndorfer

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

数值分析 · 数学 2023-07-25 Yohei M. Koyama

The elliptic-matrix quantum Olshanetsky-Perelomov problem is introduced for arbitrary root systems by means of an elliptic generalization of the Dunkl operators. Its equivalence with the double affine generalization of the…

高能物理 - 理论 · 物理学 2009-10-28 Ivan Cherednik

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

组合数学 · 数学 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko

Zonotopes are becoming an increasingly popular set representation for formal verification techniques. This is mainly due to their efficient representation and their favorable computational complexity of important operations in…

计算几何 · 计算机科学 2022-08-24 Matthias Althoff

For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we…

组合数学 · 数学 2019-04-15 Dinesh Pandey , Kamal Lochan Patra

Fleming and Foisy recently proved the existence of a digraph whose every embedding contains a $4$-component link, and left open the possibility that a directed graph with an intrinsic $n$-component link might exist. We show that, indeed,…

几何拓扑 · 数学 2019-01-07 Thomas W. Mattman , Ramin Naimi , Benjamin Pagano

The "fundamental theorem of Vassiliev invariants" says that every weight system can be integrated to a knot invariant. We discuss four different approaches to the proof of this theorem: a topological/combinatorial approach following M.…

q-alg · 数学 2008-02-03 Dror Bar-Natan , Alexander Stoimenow

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

群论 · 数学 2021-11-16 Laszlo Babai

Furthering the development of Da Lio-Gianocca-Rivi\`ere's Morse stability theory (arXiv:2212.03124) that was first applied to harmonic maps between manifolds and later extended to the case of Willmore immersions (arXiv:2306.04608-04609), we…

偏微分方程分析 · 数学 2023-12-13 Alexis Michelat

Let $H$ be a $k$-edge-coloured graph and let $n$ be a positive integer. What is the maximum number of copies of $H$ in a $k$-edge-coloured complete graph on $n$ vertices? This paper studies the case $k=2$, which we call the…

组合数学 · 数学 2025-04-22 Abdul Basit , Bertille Granet , Daniel Horsley , André Kündgen , Katherine Staden

The Zarankiewicz function gives, for a chosen matrix and minor size, the maximum number of ones in a binary matrix not containing an all-one minor. Tables of this function for small arguments have been compiled, but errors are known in…

组合数学 · 数学 2022-04-21 Jeremy Tan

Let $I(F,n)$ denote the maximum number of induced copies of a graph $F$ in an $n$-vertex graph. The inducibility of $F$, defined as $i(F)=\lim_{n\to \infty} I(F,n)/\binom{n}{v(F)}$, is a central problem in extremal graph theory. In this…

组合数学 · 数学 2026-01-23 Xizhi Liu , Jie Ma , Tianming Zhu

Motivated by open questions in the papers " Refinements and sharpenings of some double inequalities for bounding the gamma function" and "Complete monotonicity and monotonicity of two functions defined by two derivatives of a function…

经典分析与常微分方程 · 数学 2022-06-06 Mohamed Bouali

There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…

The Zarankiewicz problem asks for an estimate on $z(m, n; s, t)$, the largest number of $1$'s in an $m \times n$ matrix with all entries $0$ or $1$ containing no $s \times t$ submatrix consisting entirely of $1$'s. We show that a classical…

组合数学 · 数学 2021-07-01 David Conlon

In 1986, Tomaszewski made the following conjecture. Given $n$ real numbers $a_{1},...,a_{n}$ with $\sum_{i=1}^{n}a_{i}^{2}=1$, then of the $2^{n}$ signed sums $\pm a_{1} \pm ... \pm a_{n}$, at least half have absolute value at most $1$.…

组合数学 · 数学 2021-03-02 Vojtěch Dvořák , Peter van Hintum , Marius Tiba

This note is a complement to Pusz--Woronowicz's works on functional calculus for two positive forms from the viewpoint of operator theory. Based on an elementary, self-contained and purely Hilbert space operator explanation of their…

泛函分析 · 数学 2021-10-26 Kanae Hatano , Yoshimichi Ueda

In the first Heisenberg group, we study entire, locally Sobolev intrinsic graphs that are stable for the sub-Riemannian area. We show that, under appropriate integrability conditions for the derivatives, the intrinsic graph must be an…

微分几何 · 数学 2025-08-27 Sebastiano Nicolussi Golo , Francesco Serra Cassano , Mattia Vedovato
‹ 上一页 1 8 9 10 下一页 ›