相关论文: On the first and second eigenvalue of finite and i…

In 1979, Neumaier gave a bound on $\lambda$ in terms of $m$ and $\mu$, where $-m$ is the smallest eigenvalue of a primitive strongly regular graph, unless the graph in question belongs to one of the two infinite families of strongly regular…

We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

Let $\pi$ be a cuspidal automorphic representation of a general linear group over the rational numbers. We establish a subconvex bound for the standard $L$-function of $\pi$ in the $t$-aspect. More generally, we address the spectral aspect…

The notion of spectrum of first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. We study properties of spectrum for first-order formulae with bounded quantifier…

The notion of spectrum for first-order properties introduced by J. Spencer for Erdos-Renyi random graph is considered in relation to random uniform hypergraphs. In this work we study the set of limit points of the spectrum for first-order…

We study solutions of the generalized porous medium equation on infinite graphs. For nonnegative or nonpositive integrable data, we prove the existence and uniqueness of mild solutions on any graph. For changing sign integrable data, we…

In 1970 Nosal gave upper and lower bounds on the sum of the spectral radii of a graph and its complement. We generalize this problem to other eigenvalues and give a number of bounds. We essentially solve the corresponding problem for the…

Let $A_n$ be the anti-regular graph of order $n.$ It was conjectured that among all threshold graphs on $n$ vertices, $A_n$ has the smallest positive eigenvalue and the largest eigenvalue less than $-1.$ Recently, in \cite{Cesar2} was given…

Let $\lambda_2(G)$ and $\kappa'(G)$ be the second largest eigenvalue and the edge-connectivity of a graph $G$, respectively. Let $d$ be a positive integer at least 3. For $t=1$ or 2, Cioaba proved sharp upper bounds for $\lambda_2(G)$ in a…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

A description of group automorphisms of all two-dimensional algebras, considered up to isomorphism, over any basic field is provided.

Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are…

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

We introduce the discrete poly-Laplace operator on a subgraph with Dirichlet boundary condition. We obtain upper and lower bounds for the sum of the first $k$ Dirichlet eigenvalues of the poly-Laplace operators on a finite subgraph of…

A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…