Related papers: On Modal {\mu}-Calculus over Finite Graphs with Bo…

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a novel upper bound on the maximum anti-forcing number of $G$…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…

We constrain the spectrum of $\mathcal{N}=(1, 1)$ and $\mathcal{N}=(2, 2)$ superconformal field theories in two-dimensions by requiring the NS-NS sector partition function to be invariant under the $\Gamma_\theta$ congruence subgroup of the…

We study an extension of modal $\mu$-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability…

We fix the lexicographic order $\prec$ on the polynomial ring $S=k[x_{1},...,x_{n}]$ over a ring $k$. We define $\Hi^{\prec\Delta}_{S/k}$, the moduli space of reduced Gr\"obner bases with a given finite standard set $\Delta$, and its open…

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…

We show that the finite simply connected 2-complexes of nonpositive planar sectional curvature are collapsible. Moreover, we show that each finite connected 2-complex with negative planar sectional curvature and fundamental group…

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…

A connected r-regular graph, where $r \geq 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participates in some perfect matching. We set out to: (i) characterize…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

The predictions of the MSSM are discussed in the light of recent LEP and SLD precision data. The full supersymmetric one loop corrections to the effective weak mixing angle, experimentally determined in LEP and SLD experiments, are…

Let $n$ be a positive integer, $\sigma$ be an element of the symmetric group $\mathcal{S}_n$ and let $\sigma$ be a cycle of length $n$. The elements $\alpha ,\beta \in \mathcal{S}_n$ are $\sigma$-equivalent, if there are natural numbers $k$…

We use the slice filtration to study the $MU$-homology of the fixed points of connective models of Lubin--Tate theory studied by Hill--Hopkins--Ravenel and Beaudry--Hill--Shi--Zeng. We show that, unlike their periodic counterparts $EO_n$,…

A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…

Let $R$ be the ring of integers in a finite extension $K$ of $\mathbb{Q}_p$, let $k$ be its residue field and let $\chi:\pi_1(X)\to R^{\times}=GL_{1}(R)$ be a "geometric" rank one representation of the arithmetic fundamental group of a…