Related papers: Khintchine inequalities, trace monoids and Tur\'an…

In this paper, we mainly study the trace norm of the adjacency matrix of a graph, also known as the energy of graph. We give the maximum trace norms for the graph and its complement. In fact, the above problem is stated and solved in a more…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

Extremal functions are exhibited in Poincar\'e trace inequalities for functions of bounded variation in the unit ball ${\mathbb B}^n$ of the $n$-dimensional Euclidean space ${\mathbb R}^n$. Trial functions are subject to either a vanishing…

We calculate the integrated trace anomaly for a real spin-0 scalar field in six dimensions in a torsionless curved space without a boundary. We use a path integral approach for a corresponding supersymmetric quantum mechanical model. Weyl…

For a family of graphs $\F$, a graph is called $\F$-free if it does not contain any member of $\F$ as a subgraph. The generalized Tur\'an number $\ex(n,K_r,\F)$ is the maximum number of $K_r$ in an $n$-vertex $\F$-free graph and…

Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The general Tur\'an number, denoted by $ex(n, H,\mathscr{F})$, is the maximum number of copies of $H$…

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…

Keevash, Lenz and Mubayi developed a general criterion for hypergraph spectral extremal problems in their seminal work (SIAM J. Discrete Math., 2014). Their framework shows that extremal results on the $\alpha$-spectral radius (for $\alpha…

Spectral graph theory studies how the eigenvalues of a graph relate to the structural properties of a graph. In this paper, we solve three open problems in spectral extremal graph theory which generalize the classical Tur\'{a}n-type…

This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…

The generalized Tur\'an number $\text{ex}(n, H, F)$ denotes the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Let $kK_{r+1}$ be the disjoint union of $k$ copies of the complete graph $K_{r+1}$. Recently, Gerbner…

The Tur\'{a}n problem asks for the largest number of edges ex$(n,H)$ in an $n$-vertex graph not containing a fixed forbidden subgraph $H$, which is one of the most important problems in extremal graph theory. However the order of magnitude…

Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in…

In this work we develop a discrete trace theory that spans non-conforming hybrid discretization methods and holds on polytopal meshes. A notion of a discrete trace seminorm is defined, and trace and lifting results with respect to a…

An asymptotic formula with a square root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra over a finite field. This extends previous results from finite etale algebras (commutative…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

The classical extremal function for a graph $H$, $ex(K_n, H)$ is the largest number of edges in a subgraph of $K_n$ that contains no subgraph isomorphic to $H$. Note that defining $ex(K_n, H-ind)$ by forbidding induced subgraphs isomorphic…

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

Energy level statistics of quantized chaotic systems have been evaluated in the semiclassical limit via their periodic orbits using the Gutzwiller and related trace formulae. Here we evaluate a spectral statistic of chaotic 4-regular…

In the past decades, one of the most fruitful approaches to the study of algebraic $K$-theory has been trace methods, which construct and study trace maps from algebraic $K$-theory to topological Hochschild homology and related invariants.…