中文
相关论文

相关论文: Local distributions for eigenfunctions and for per…

200 篇论文

Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…

组合数学 · 数学 2024-10-25 Anna A. Taranenko

Under study are eigenfunctions of $q$-ary $n$-dimensional hypercube. Given all values of an eigenfunction in the sphere we develop methods to reconstruct the function in full or in part. First, we obtain that all values of the function in…

组合数学 · 数学 2014-12-12 Anastasia Vasil'eva

A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…

组合数学 · 数学 2014-04-16 Vladimir N. Potapov

We consider the problem of existence of perfect $2$-colorings (equitable $2$-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we…

The Hamming graph $H(n,q)$ is the graph whose vertices are the words of length $n$ over the alphabet $\{0,1,\ldots,q-1\}$, where two vertices are adjacent if they differ in exactly one coordinate. The adjacency matrix of $H(n,q)$ has $n+1$…

组合数学 · 数学 2020-03-04 Alexandr Valyuzhenich

The main aim of the present paper is to introduce new methods for the study of combinatorial designs related to bent functions. They are based on interpretations of convolution on finite abelian groups as multiplication by a…

组合数学 · 数学 2026-02-17 Vladimir N. Potapov , Anna A. Taranenko

We describe the eigenvalues and the eigenspaces of the adjacency matrices of subgraphs of the Hamming cube induced by Hamming balls, and more generally, by a union of adjacent concentric Hamming spheres. As a corollary, we extend the range…

组合数学 · 数学 2024-11-25 Amit Avni , Alex Samorodnitsky

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…

概率论 · 数学 2022-05-26 Ron Peled , Yinon Spinka

A perfect $k$-coloring of the Boolean hypercube $Q_n$ is a function from the set of binary words of length $n$ onto a $k$-set of colors such that for any colors $i$ and $j$ every word of color $i$ has exactly $S(i,j)$ neighbors (at Hamming…

组合数学 · 数学 2024-07-15 Denis S. Krotov , Alexandr A. Valyuzhenich

We obtain a classification of the completely regular codes with covering radius 1 and the second eigenvalue in the Hamming graphs H(3,q) up to q and intersection array. Due to works of Meyerowitz, Mogilnykh and Valyuzenich, our result…

组合数学 · 数学 2024-03-06 Ivan Mogilnykh , Anna Taranenko , Konstantin Vorob'ev

In this paper we obtain the necessary condition for the existence of perfect $k$-colorings (equitable $k$-partitions) in Hamming graphs $H(n,q)$, where $q=2,3,4$ and Doob graphs $D(m,n)$. As an application, we prove the non-existence of…

组合数学 · 数学 2020-09-01 Evgeny Bespalov

For graphs $G$ and $H$, an $H$-coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colorings encode graph theory notions such as independent sets and proper colorings, and are a…

组合数学 · 数学 2012-06-15 John Engbers , David Galvin

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

数学物理 · 物理学 2014-05-23 Lionel Kameni , Roman Schubert

We investigate the distributions of the number of: (1) monochromatic complete subgraphs over edgewise 2-colorings of complete graphs; and (2) monochromatic arithmetic progressions over 2-colorings of intervals, as statistical Ramsey theory…

组合数学 · 数学 2018-01-19 Aaron Robertson , William Cipolli , Maria Dascalu

There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R.…

交换代数 · 数学 2010-11-03 Christopher A. Francisco , Huy Tai Ha , Adam Van Tuyl

We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local…

组合数学 · 数学 2024-06-12 Jesse Campion Loth

Consider a hypergraph $H_n^d$ where the vertices are points of the $d$-dimensional combinatorial cube $n^d$ and the edges are all sets of $n$ points such that they are in one line. We study the structure of the group of automorphisms of…

离散数学 · 计算机科学 2020-12-11 Pavel Dvořák , Tomáš Valla

We prove a new quantum variance estimate for toral eigenfunctions. As an application, we show that, given any orthonormal basis of toral eigenfunctions and any smooth embedded hypersurface with nonvanishing principal curvatures, there…

偏微分方程分析 · 数学 2018-02-06 Hamid Hezari , Gabriel Riviere

The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this…

概率论 · 数学 2016-12-21 Zhigang Bao , Laszlo Erdos , Kevin Schnelli

In this paper we analyse the structure of the spaces of coefficients of eigenfunction expansions of functions in Komatsu classes on compact manifolds, continuing the research in our previous paper. We prove that such spaces of Fourier…

泛函分析 · 数学 2017-07-14 Aparajita Dasgupta , Michael Ruzhansky
‹ 上一页 1 2 3 10 下一页 ›