English
Related papers

Related papers: Multi-linear forms, graphs, and $L^p$-improving me…

200 papers

Consider the operator $$T_Kf(x)=\int_{{\mathbb R}^d} K(x,y) f(y) dy,$$ where $K$ is a locally integrable function or a measure. The purpose of this paper is to study the multi-linear form $$ \Lambda^K_G(f_1, \dots, f_n)=\int \dots \int…

Classical Analysis and ODEs · Mathematics 2024-02-01 A. Iosevich , E. Palsson , Y. Zhai , E. Wyman

We undertake a systematic study of the mapping properties of forms based on distance graphs in $\mathbb{Z}^{d}$ to see how the structure of a graph, $G$, affects the $\ell^{p}$ improving estimates of the form, $\Lambda_{G}$, based on $G$.…

Classical Analysis and ODEs · Mathematics 2026-05-13 Eyvindur Palsson , Jennifer Smucker

The $k$-th token graph of a graph $G=(V,E)$ is the graph $F_k(G)$ whose vertices are the $k$-subsets of $V$ and whose edges are all pairs of $k$-subsets $A,B$ such that the symmetric difference of $A$ and $B$ forms an edge in $G$. Let…

Combinatorics · Mathematics 2023-05-05 Alan Lew

The purpose of this paper is to develop a general existence theory for constrained minimization problems for functionals defined on function spaces on metric measure spaces $(\mathcal M, d, \mu)$. We apply this theory to functionals defined…

Analysis of PDEs · Mathematics 2020-07-10 Matthias Hofmann

The goal of this paper is to study operators of the form, \[ Tf(x)= \psi(x)\int f(\gamma_t(x))K(t)\: dt, \] where $\gamma$ is a real analytic function defined on a neighborhood of the origin in $(t,x)\in \R^N\times \R^n$, satisfying…

Classical Analysis and ODEs · Mathematics 2011-05-24 Elias M. Stein , Brian Street

We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…

Combinatorics · Mathematics 2014-10-24 Javier Soria , Pedro Tradacete

Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…

General Mathematics · Mathematics 2008-07-14 Márton Elekes , Tamás Keleti , András Máthé

Identifying important components in a network is one of the major goals of network analysis. Popular and effective measures of importance of a node or a set of nodes are defined in terms of suitable entries of functions of matrices $f(A)$.…

Numerical Analysis · Mathematics 2021-03-01 Stefano Pozza , Francesco Tudisco

Let $\sigma_i$, $i=1,\ldots,n$, denote positive Borel measures on $\mathbb{R}^d$, let $\mathcal{D}$ denote the usual collection of dyadic cubes in $\mathbb{R}^d$ and let $K:\,\mathcal{D}\to[0,\infty)$ be a~map. In this paper we give…

Classical Analysis and ODEs · Mathematics 2015-01-13 Hitoshi Tanaka

Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…

Combinatorics · Mathematics 2010-03-30 Diana R. Cerzo

We give necessary and sufficient conditions in order that inequalities of the type $$ \| T_K f\|_{L^q(d\mu)}\leq C \|f\|_{L^p(d\sigma)}, \qquad f \in L^p(d\sigma), $$ hold for a class of integral operators $T_K f(x) = \int_{R^n} K(x, y)…

Functional Analysis · Mathematics 2007-05-23 Carme Cascante , Joaquin M. Ortega , Igor E. Verbitsky

For a function $\mathsf{K} : \mathbb{R}^{d} \times \mathbb{R}^{d} \to \mathbb{R}_{\geq 0}$, and a set $P = \{ x_1, \ldots, x_n\} \subset \mathbb{R}^d$ of $n$ points, the $\mathsf{K}$ graph $G_P$ of $P$ is the complete graph on $n$ nodes…

Data Structures and Algorithms · Computer Science 2020-11-05 Josh Alman , Timothy Chu , Aaron Schild , Zhao Song

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…

Combinatorics · Mathematics 2024-08-21 Esen Aksoy , Alex Iosevich , Brian McDonald

We study 3d and 4d systems with a one-form global symmetry, explore their consequences, and analyze their gauging. For simplicity, we focus on $\mathbb{Z}_N$ one-form symmetries. A 3d topological quantum field theory (TQFT) $\mathcal{T}$…

High Energy Physics - Theory · Physics 2019-04-02 Po-Shen Hsin , Ho Tat Lam , Nathan Seiberg

Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $\text{ind-match}(G)$, $\text{min-match}(G)$ and $\text{match}(G)$ denote the induced matching number, the minimum matching number and the matching number of $G$,…

Combinatorics · Mathematics 2022-03-01 Kazunori Matsuda , Yuichi Yoshida

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

Combinatorics · Mathematics 2011-10-05 Thomas Enkosky , Jeremy L. Martin

The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph…

Data Structures and Algorithms · Computer Science 2016-09-20 Luis Pedro Montejano , Ignasi Sau

The purpose of this paper is to study the $L^2$ boundedness of operators of the form \[ f\mapsto \psi(x) \int f(\gamma_t(x)) K(t) dt, \] where $\gamma_t(x)$ is a $C^\infty$ function defined on a neighborhood of the origin in $(t,x)\in…

Classical Analysis and ODEs · Mathematics 2015-03-17 Brian Street

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…

Combinatorics · Mathematics 2015-03-09 Peter Diao , Dominique Guillot , Apoorva Khare , Bala Rajaratnam

We establish a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. At the center of this framework lies the concept of a $\leqslant$-parametric graph:…

Combinatorics · Mathematics 2024-11-26 Christophe Paul , Evangelos Protopapas , Dimitrios M. Thilikos
‹ Prev 1 2 3 10 Next ›