English
Related papers

Related papers: An affirmative answer to a problem posed by Zaline…

200 papers

In this paper, {we extend the affine dual curvature measures to the $L_p$ setting and solve the existence part of the corresponding Minkowski problem for non-symmetric discrete measures when $p>1$ and for symmetric measures when $p\geq0$.}…

Metric Geometry · Mathematics 2026-01-19 Youjiang Lin , Yuchi Wu

Two generalizations of the Minkowski ?(x) function are given. As ?(x) maps quadratic irrationals to rational numbers, it is shown that both generalizations send natural classes of pairs of cubic irrational numbers in the same cubic number…

Number Theory · Mathematics 2007-05-23 Andrew Marder

A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…

High Energy Physics - Phenomenology · Physics 2008-11-26 G. Passarino

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Functional Analysis · Mathematics 2023-01-06 Daniel Lenz , Simon Puchert , Marcel Schmidt

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

Geometric Topology · Mathematics 2007-05-23 J. Campbell , T. W. Mattman , R. Ottman , J. Pyzer , M. Rodrigues , S. Williams

We determine the maximum number of induced cycles that can be contained in a graph on $n\ge n_0$ vertices, and show that there is a unique graph that achieves this maximum. This answers a question of Tuza. We also determine the maximum…

Combinatorics · Mathematics 2017-04-13 Natasha Morrison , Alex Scott

Ne\v{s}et\v{r}il and \v{S}\'{a}mal asked whether every cubelike graph has a cubelike core. Man\v{c}inska, Pivotto, Roberson and Royle answered this question in the affirmative for cubelike graphs whose core has at most $32$ vertices. When…

Combinatorics · Mathematics 2025-01-31 Guang Rao , Colin Tan

We consider the notion of real center of mass and total center of mass of a bounded linear operator relative to another bounded linear operator and explore their relation with cosine and total cosine of a bounded linear operator acting on a…

Functional Analysis · Mathematics 2024-07-30 Kallol Paul , Gopal Das

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Quantum Algebra · Mathematics 2019-07-01 Christian Eder , Viktor Levandovskyy , Julien Schanz , Simon Schmidt , Andreas Steenpass , Moritz Weber

Greene and Zaslavsky proved that the number of acyclic orientations of a graph with a unique sink is, up to sign, the linear coefficient of the chromatic polynomial. We give three new proofs of this result using pure induction,…

Combinatorics · Mathematics 2007-05-23 David D. Gebhard , Bruce E. Sagan

General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of $m$ arbitrary ellipsoids in $N$-dimensional Euclidean space. Expressions for the principal curvatures…

Metric Geometry · Mathematics 2021-03-30 Gregory S. Chirikjian , Bernard Shiffman

We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…

Computational Geometry · Computer Science 2012-11-27 Menelaos I. Karavelas , Christos Konaxis , Eleni Tzanaki

Based on many experts' former work in the Jacobian conjecture and an essential analysis of intrinsic topology of linear maps, I completely prove the Jacobian conjecture by demonstrating the injectivity of real Keller map of any…

Algebraic Geometry · Mathematics 2020-09-03 Quan Xu

We establish that a mode-coupling approximation for the dynamics of multi-component systems obeying Smoluchowski dynamics preserves a subtle yet fundamental property: the matrices of partial density correlation functions are completely…

Soft Condensed Matter · Physics 2011-08-12 T. Franosch , Th. Voigtmann

The objective of this paper is to study a special family of Minkowski sums, that is of polytopes relatively in general position. We show that the maximum number of faces in the sum can be attained by this family. We present a new linear…

Combinatorics · Mathematics 2008-04-28 Komei Fukuda , Christophe Weibel

Motivated by a possible connection between the $\mathrm{SU}(N)$ instanton knot Floer homology of Kronheimer and Mrowka and $\mathfrak{sl}(N)$ Khovanov-Rozansky homology, Lobb and Zentner recently introduced a moduli problem associated to…

Geometric Topology · Mathematics 2013-10-21 Jonathan Grant

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

Combinatorics · Mathematics 2007-05-23 François Genest

We prove complete monotonicity of sums of squares of generalized Baskakov basis functions by deriving the corresponding results for hypergeometric functions. Moreover, in the central Baskakov case we study the distribution of the complex…

Classical Analysis and ODEs · Mathematics 2014-12-01 Ulrich Abel , Wolfgang Gawronski , Thorsten Neuschel

Using a graph representation of classical logic, the paper shows that the liar or Yablo pattern occurs in every semantic paradox. The core graph theoretic result generalizes theorem of Richardson, showing solvability of finite graphs…

Logic · Mathematics 2023-10-10 Michal Walicki

In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…

Dynamical Systems · Mathematics 2016-02-16 Terry Soo