Related papers: Sign patterns which require or allow the strong mu…
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
We study the differential geometric properties of the manifold of non-singular symmetric real matrices endowed with the trace metric; in case of positive definite matrices we describe the full group of isometries
Three basic properties that standard graded artinian $k$-algebras may or may not enjoy are the Weak and Strong Lefschetz Properties and the Maximal Rank Property (respectively WLP, SLP, and MRP). In this paper we will assume that the base…
To each permutation $\sigma$ in $S_{n}$ we associate a triangulation of a fixed $(n+2)$-gon. We then determine the fibers of this association and show that they coincide with the sylvester classes depicted By Novelli, Hivert and Thibon. A…
We extend Culler and Shalen's construction of detecting essential surfaces in 3-manifolds to 3-orbifolds. We do so in the setting of the $\mathrm{SL}_2(\mathbb{C})$ character variety, and following Boyer and Zhang in the…
We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…
In the last decade, the concept of path signature has achieved significant success in data science applications. It offers a powerful set of features that effectively capture and describe the characteristics of paths or sequential data.…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We first prove two new spectral properties for symmetric nonnegative tensors. We prove a maximum property for the largest H-eigenvalue of a symmetric nonnegative tensor, and establish some bounds for this eigenvalue via row sums of that…
Nonclassicality in the sense of quantum optics is a prerequisite for entanglement in multi-mode radiation states. In this work we bring out the possibilities of passing from the former to the latter, via action of classicality preserving…
Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…
We define families of invariants for elements of the mapping class group of S, a compact orientable surface. Fix any characteristic subgroup H of pi_1(S) and restrict to J(H), any subgroup of mapping classes that induce the identity modulo…
We show that if a positive integer $q$ has $s(q)$ odd prime divisors $p$ for which $p^2$ divides $q$, then a positive proportion of the Laplacian eigenvalues of Maass newforms of weight $0$, level $q$, and principal character occur with…
The scattering formulation of characteristic mode decomposition is utilized to extend modal analysis to lossless scatterers breaking time-reversal symmetry. This enables characteristic modes analysis on devices containing gyrotropic or…
A signed complete graph contains both positive and negative Hamiltonian cycles if and only if it also contains both positive and negative triangles. Otherwise, all Hamiltonian cycles are negative if and only if all triangles are negative…
The structure of the graph defined by the interactions in a Boolean network can determine properties of the asymptotic dynamics. For instance, considering the asynchronous dynamics, the absence of positive cycles guarantees the existence of…
The study of eigenvalue multiplicities plays a central role in the spectral theory of signed graphs, extending several classical results from the unsigned setting. While most existing work focuses on the nullity of a signed graph (the…
Understanding when two non-isomorphic graphs can have the same spectra is a classic problem that is still not completely understood, even for integral circulant graphs. We say that a natural number $N$ satisfies the \emph{integral spectral…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…