English
Related papers

Related papers: Multi-linear forms, structure of graphs and Lebesg…

200 papers

Based on our previous work on an arithmetic analogue of Christol's theorem, this paper studies in more detail the structure of the lambda-ring $E_K = K \otimes W_{O_K}^a (O_{\bar{K}})$ of algebraic Witt vectors for number fields $K$. First…

Number Theory · Mathematics 2021-11-05 Takeo Uramoto

Given a graph $G=(V,E)$, an integer $k$, and a function $f_G:V^k \times V^k \to {0,1}$, the $k^{th}$ graph product of $G$ w.r.t $f_G$ is the graph with vertex set $V^k$, and an edge between two vertices $x=(x_1,...,x_k)$ and…

Discrete Mathematics · Computer Science 2013-09-05 Michael Langberg , Dan Vilenchik

Fix $N\in\mathbb N$ and assume that for every $n\in\{1,\ldots, N\}$ the functions $f_n\colon[0,1]\to[0,1]$ and $g_n\colon[0,1]\to\mathbb R$ are Lebesgue measurable, $f_n$ is almost everywhere approximately differentiable with…

Classical Analysis and ODEs · Mathematics 2018-11-16 Janusz Morawiec , Thomas Zürcher

A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. KGs are an important primitive in modern machine learning and artificial intelligence.…

Artificial Intelligence · Computer Science 2021-10-20 Michael R. Douglas , Michael Simkin , Omri Ben-Eliezer , Tianqi Wu , Peter Chin , Trung V. Dang , Andrew Wood

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…

Chaotic Dynamics · Physics 2007-05-23 Prot Pakonski , Gregor Tanner , Karol Zyczkowski

We study the eigenvalues $\lambda_1,\lambda_2,\lambda_3,\ldots$ (ordered by modulus) of the integral kernel $K(x,y) := \frac{1}{2} + \lfloor \frac{1}{x y}\rfloor - \frac{1}{x y}$ ($0<x,y\leq 1$). This kernel is of interest in connection…

Number Theory · Mathematics 2023-08-25 Nigel Watt

Fix non-zero reals $\alpha_1,\ldots,\alpha_n$ with $n\ge 2$ and let $K$ be a non-empty open connected set in a topological vector space such that $\sum_{i\le n}\alpha_iK\subseteq K$ (which holds, in particular, if $K$ is an open convex cone…

Functional Analysis · Mathematics 2019-06-03 Paolo Leonetti , Jens Schwaiger

Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…

Combinatorics · Mathematics 2007-05-23 Jacob Towber

In this paper we study various Rogers-Shephard type inequalities for the lattice point enumerator $\mathrm{G}_{n}(\cdot)$ on $\mathbb{R}^n$. In particular, for any non-empty convex bounded sets $K,L\subset\mathbb{R}^n$, we show that…

Metric Geometry · Mathematics 2022-03-01 David Alonso-Gutiérrez , Eduardo Lucas , Jesús Yepes Nicolás

In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…

Complex Variables · Mathematics 2021-06-15 Alexander Brudnyi

Let integers $r\ge 2$ and $d\ge 3$ be fixed. Let ${\cal G}_d$ be the set of graphs with no induced path on $d$ vertices. We study the problem of packing $k$ vertex-disjoint copies of $K_{1,r}$ ($k\ge 2$) into a graph $G$ from parameterized…

Data Structures and Algorithms · Computer Science 2015-10-14 Florian Barbero , Gregory Gutin , Mark Jones , Bin Sheng , Anders Yeo

This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…

High Energy Physics - Theory · Physics 2018-07-03 Eric D'Hoker , Michael B. Green

A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have…

Combinatorics · Mathematics 2021-12-01 Vladislav V. Kabanov

We prove mixed inequalities for commutators of Calder\'on-Zygmund operators (CZO) with multilinear symbols. Concretely, let $m\in\mathbb{N}$ and $\mathbf{b}=(b_1,b_2,\dots, b_m)$ be a vectorial symbol such that each component $b_i\in…

Classical Analysis and ODEs · Mathematics 2021-08-23 Fabio Berra , Marilina Carena , Gladis Pradolini

Let (M,g) be a compact Riemannian manifold of dimension n. For k \in {0,...,n}, we denote Gr_{k}(M) the set of compact, connected and oriented submanifolds of M of dimension k. This set is called the non-linear Grassmannian. In this…

Differential Geometry · Mathematics 2012-05-01 Mathieu Molitor

A continuation of the joint work by Vadim Gorin and the author, J. Funct. Anal. 270 (2016), 375-418; arXiv:1504.06832. The extended Gelfand-Tsetlin graph, introduced in that paper, is a novel combinatorial object. Its q-boundary is formed…

Probability · Mathematics 2016-07-15 Grigori Olshanski

A generalization of the celebrated Falconer distance problem asks for a graph $G=(\mathcal{V},\mathcal{E})$, with vertex set $\mathcal{V}$ and edge set $\mathcal{E}$, how large the Hausdorff dimension of a compact set $E\subset…

Classical Analysis and ODEs · Mathematics 2026-03-03 Tainara Borges , Ben Foster , Yumeng Ou , Eyvindur Palsson , Francisco Romero Acosta

This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…

Geometric Topology · Mathematics 2026-05-06 Makoto Ozawa

In this paper fundamental nonlinear geometries of Lebesgue sequence spaces are studied in their quantitative aspects. Applications of this work are a positive solution to the strong embeddability problem from $\ell_q$ into $\ell_p$…

Functional Analysis · Mathematics 2017-09-27 Florent P. Baudier

Let $G$ be a prolific graph, that is a finite connected simple graph which is not isomorphic to a cycle nor a path nor the star graph $K_{1,3}$. The line-graph of $G$, denoted by $L(G)$, is defined by having its vertex-set equal to the…

Combinatorics · Mathematics 2022-01-14 Yair Caro , Josef Lauri , Christina Zarb