Related papers: Modular Irregularity Strength of Triangular Book G…
Neural Collapse refers to the remarkable structural properties characterizing the geometry of class embeddings and classifier weights, found by deep nets when trained beyond zero training error. However, this characterization only holds for…
Learning invariant representations is an important requirement when training machine learning models that are driven by spurious correlations in the datasets. These spurious correlations, between input samples and the target labels, wrongly…
Let $\mathcal{D}$ be a Hom-finite, Krull-Schmidt, 2-Calabi-Yau triangulated category with a rigid object $R$. Let $\Lambda=\operatorname{End}_{\mathcal{D}}R$ be the endomorphism algebra of $R$. We introduce the notion of mutation of maximal…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
Let $t$ be a positive real number. A graph is called \emph{$t$-tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $|S|/t$ components. The toughness of a graph is the largest $t$ for which the graph is…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
Though extensively studied, hardness, defined as the resistance of a material to deformation, still remains a challenging issue for a formal theoretical description due to its inherent mechanical complexity. The widely applied Teter's…
We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.
One of the intensely studied concepts of network robustness is $r$-robustness, which is a network topology property quantified by an integer $r$. It is required by mean subsequence reduced (MSR) algorithms and their variants to achieve…
A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…
We consider the inverse problem of identifying an unknown inclusion contained in an elastic body by the Dirichlet-to-Neumann map. The body is made by linearly elastic, homogeneous and isotropic material. The Lam\'e moduli of the inclusion…
Modular graph forms are a class of modular covariant functions which appear in the genus-one contribution to the low-energy expansion of closed string scattering amplitudes. Modular graph forms with holomorphic subgraphs enjoy the…
A numbering $f$ of a graph $G$ of order $n$ is a labeling that assigns distinct elements of the set $\left\{ 1,2,\ldots ,n\right\} $ to the vertices of $G$, where each $uv\in E\left( G\right) $ is labeled $f\left( u\right) +f\left( v\right)…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
We prove moderate deviations bounds for the lower tail of the number of odd cycles in a $\calG(n, m)$ random graph. We show that the probability of decreasing triangle density by $t^3$, is $\exp(-\Theta(n^2 t^2))$ whenever $n^{-3/4} \ll t^3…
We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…
In this paper, motivated by a $\tau$-tilting version of the Brauer-Thrall Conjectures, we study general properties of band modules and their endomorphisms in the module category of a finite dimensional algebra. As an application we describe…
This work investigates the phenomenon of Neural Collapse (NC) in multi-label classification, extending its conceptual framework from multi-class learning to general correlated and imbalanced multi-label settings. Although recent studies…
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation $\rho_T$ that neatly combines intergraph with intragraph…
The stable module category of a selfinjective algebra is triangulated, but need not have any nontrivial $t$-structures, and in particular, full abelian subcategories need not arise as hearts of a $t$-structure. The purpose of this paper is…