137,107 results on '"Mathematics - Combinatorics"'
Search Results
2. Discrete (P)-closed Groups Acting On Trees
- Author
-
Chijoff, Marcus and Tornier, Stephan
- Subjects
Mathematics - Group Theory ,Mathematics - Combinatorics ,20E08, 22D05 - Abstract
Reid-Smith recently parametrised groups acting on trees with Tits' independence property (P) using graph-based combinatorial structures known as local action diagrams. Properties of the acting (topological) group, such as being locally compact, compactly generated or simple, are reflected in its local action diagram. In this article we provide necessary and sufficient conditions on the local action diagram for the associated group to be discrete., Comment: 16 pages, 2 figures
- Published
- 2024
3. The First Zagreb Index, the Forgotten Topological Index, the Inverse Degree and Some Hamiltonian Properties of Graphs
- Author
-
Li, Rao
- Subjects
Mathematics - Combinatorics - Abstract
Let $G = (V, E)$ be a graph. The first Zagreb index and the forgotten topological index of a graph $G$ are defined respectively as $\sum_{u \in V} d^2(u)$ and $\sum_{u \in V} d^3(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. If the minimum degree of $G$ is at least one, the inverse degree of $G$ is defined as $\sum_{u \in V} \frac{1}{d(u)}$. In this paper, we, for a graph with minimum degree at least one, present an upper bound for the first Zagreb index of the graph and lower bounds for the forgotten topological index and the inverse degree of the graph. We also present sufficient conditions involving the first Zagreb index, the forgotten topological index, or the inverse degree for some Hamiltonian properties of a graph., Comment: arXiv admin note: substantial text overlap with arXiv:2409.02593
- Published
- 2024
4. Cuts, Cats, and Complete Graphs
- Author
-
Ashmore, Rylo, Dyer, Danny, Marbach, Trent, and Milley, Rebecca
- Subjects
Mathematics - Combinatorics ,05C57 (Primary) 91A24, 91A46, 68R05 (Secondary) - Abstract
We introduce the game of Cat Herding, where an omnipresent herder slowly cuts down a graph until an evasive cat player has nowhere to go. The number of cuts made is the score of a game, and we study the score under optimal play. In this paper, we begin by deriving some general results, and then we determine the precise cat number for paths, cycles, stars, and wheels. Finally, we identify an optimal Cat and Herder strategy on complete graphs, while providing both a recurrence and closed form for $cat(K_n)$., Comment: 31 pages with appendix
- Published
- 2024
5. On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
- Author
-
Liu, Xiaonan, Lu, Linyuan, and Wang, Zhiyu
- Subjects
Mathematics - Combinatorics ,05C10, 51F99 - Abstract
In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then $G$ has at most $10$ vertices, and this upper bound is sharp., Comment: 17 pages
- Published
- 2024
6. Parameterised Holant Problems
- Author
-
Aivasiliotis, Panagiotis, Göbel, Andreas, Roth, Marc, and Schmitt, Johannes
- Subjects
Computer Science - Computational Complexity ,Mathematics - Combinatorics - Abstract
We investigate the complexity of parameterised holant problems $\textsc{p-Holant}(\mathcal{S})$ for families of signatures~$\mathcal{S}$. The parameterised holant framework was introduced by Curticapean in 2015 as a counter-part to the classical theory of holographic reductions and algorithms and it constitutes an extensive family of coloured and weighted counting constraint satisfaction problems on graph-like structures, encoding as special cases various well-studied counting problems in parameterised and fine-grained complexity theory such as counting edge-colourful $k$-matchings, graph-factors, Eulerian orientations or, subgraphs with weighted degree constraints. We establish an exhaustive complexity trichotomy along the set of signatures $\mathcal{S}$: Depending on $\mathcal{S}$, $\textsc{p-Holant}(\mathcal{S})$ is: (1) solvable in FPT-near-linear time (i.e. $f(k)\cdot \tilde{\mathcal{O}}(|x|)$); (2) solvable in "FPT-matrix-multiplication time" (i.e. $f(k)\cdot {\mathcal{O}}(n^{\omega})$) but not solvable in FPT-near-linear time unless the Triangle Conjecture fails; or (3) #W[1]-complete and no significant improvement over brute force is possible unless ETH fails. This classification reveals a significant and surprising gap in the complexity landscape of parameterised Holants: Not only is every instance either fixed-parameter tractable or #W[1]-complete, but additionally, every FPT instance is solvable in time $f(k)\cdot {\mathcal{O}}(n^{\omega})$. We also establish a complete classification for a natural uncoloured version of parameterised holant problem $\textsc{p-UnColHolant}(\mathcal{S})$, which encodes as special cases the non-coloured analogues of the aforementioned examples. We show that the complexity of $\textsc{p-UnColHolant}(\mathcal{S})$ is different: Depending on $\mathcal{S}$ all instances are either solvable in FPT-near-linear time, or #W[1]-complete.
- Published
- 2024
7. Jordan Type stratification of spaces of commuting nilpotent matrices
- Author
-
Boij, Mats, Iarrobino, Anthony, and Khatami, Leila
- Subjects
Mathematics - Commutative Algebra ,Mathematics - Combinatorics ,Primary: 15A27, Secondary: 05A17, 13E10, 14A05, 15A20 - Abstract
An $n\times n$ nilpotent matrix $B$ is determined up to conjugacy by a partition $P_B$ of $n$, its Jordan type given by the sizes of its Jordan blocks. The Jordan type $\mathfrak D(P)$ of a nilpotent matrix in the dense orbit of the nilpotent commutator of a given nilpotent matrix of Jordan type $P$ is stable - has parts differing pairwise by at least two - and was determined by R. Basili. The second two authors, with B. Van Steirteghem and R. Zhao determined a rectangular table of partitions $\mathfrak D^{-1}(Q)$ having a given stable partition $Q$ as the Jordan type of its maximum nilpotent commutator. They proposed a box conjecture, that would generalize the answer to stable partitions $Q$ having $\ell$ parts: it was proven recently by J.~Irving, T. Ko\v{s}ir and M. Mastnak. Using this result and also some tropical calculations, the authors here determine equations defining the loci of each partition in $\mathfrak D^{-1}(Q)$, when $Q$ is stable with two parts. The equations for each locus form a complete intersection. The authors propose a conjecture generalizing their result to arbitrary stable $Q$.
- Published
- 2024
8. Closures and heavy pairs for hamiltonicity
- Author
-
Shang, Wangyi, Broersma, Hajo, Zhang, Shenggui, and Li, Binlong
- Subjects
Mathematics - Combinatorics - Abstract
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for hamiltonicity, in 2012, Li, Ryj\'a\v{c}ek, Wang and Zhang determined all connected graphs $R$ and $S$ of order at least 3 other than $P_3$ such that every 2-connected $\{R,S\}$-$o$-heavy graph is hamiltonian. In particular, they showed that, up to symmetry, $R$ must be a claw and $S\in\{P_4,P_5,C_3,Z_1,Z_2,B,N,W\}$. In 2008, \v{C}ada extended Ryj\'a\v{c}ek's closure concept for claw-free graphs by introducing what we call the $c$-closure for claw-$o$-heavy graphs. We apply it here to characterize the structure of the $c$-closure of 2-connected $\{R,S\}$-$o$-heavy graphs, where $R$ and $S$ are as above. Our main results extend or generalize several earlier results on hamiltonicity involving forbidden or $o$-heavy subgraphs.
- Published
- 2024
9. On graphs isomorphic with their conduction graph
- Author
-
Birkinshaw, Aidan, Fowler, Patrick W., Goedgebeur, Jan, and Jooken, Jorik
- Subjects
Mathematics - Combinatorics - Abstract
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices associated with a given base graph $G$ within the context of the Source-and-Sink-Potential model of ballistic conduction. The graphs $G^{\mathrm C}$ and $G$ have the same vertex set, and each edge $xy$ in $G^{\mathrm C}$ represents a conducting device with graph $G$ and connections $x$ and $y$ that conducts at the Fermi level. If $G^{\mathrm C}$ is isomorphic with the simple graph $G$ (in which case we call $G$ conduction-isomorphic), then $G$ has nullity $\eta(G)=0$ and is an ipso omni-insulator. Motivated by this, examples are provided of ipso omni-insulators of odd order, thereby answering a recent question. For $\eta(G)=0$, $G^{\mathrm C}$ is obtained by 'booleanising' the inverse adjacency matrix $A^{-1}(G)$, to form $A(G^{\mathrm C})$, i.e. by replacing all non-zero entries $(A(G)^{-1})_{xy}$ in the inverse by $1+\delta_{xy}$ where $\delta_{xy}$ is the Kronecker delta function. Constructions of conduction-isomorphic graphs are given for the cases of $G$ with minimum degree equal to two or any odd integer. Moreover, it is shown that given any connected non-bipartite conduction-isomorphic graph $G$, a larger conduction-isomorphic graph $G'$ with twice as many vertices and edges can be constructed. It is also shown that there are no 3-regular conduction-isomorphic graphs. A census of small (order $\leq 11$) connected conduction-isomorphic graphs and small (order $\leq 22$) connected conduction-isomorphic graphs with maximum degree at most three is given. For $\eta(G)=1$, it is shown that $G^{\mathrm C}$ is connected if and only if $G$ is a nut graph (a singular graph of nullity one that has a full kernel vector)., Comment: Paper accepted for publication in MATCH Commun. Math. Comput. Chem.: https://doi.org/10.46793/match.93-2.379B
- Published
- 2024
- Full Text
- View/download PDF
10. Expectation and Variance of the Degree of a Node in Random Spanning Trees
- Author
-
Sanmartín, Enrique Fita, Schnörr, Christoph, and Hamprecht, Fred A.
- Subjects
Computer Science - Discrete Mathematics ,Mathematics - Combinatorics ,05C05, 05C07 (Primary) 05C20, 05C22, 05C30, 05C80 (Secondary) - Abstract
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a node as the sum of the weights of its incident edges, we present analytical expressions for the expectation, variance and covariance of the weighted degree of a node across the Gibbs distribution. To generalize our approach, we distinguish between two types of weight: probability weights, which regulate the distribution of spanning trees, and degree weights, which define the weighted degree of nodes. This distinction allows us to define the weighted degree of nodes independently of the probability weights. By leveraging the Matrix Tree Theorem, we show that these degree moments ultimately depend on the inverse of a submatrix of the graph Laplacian. While our focus is on undirected graphs, we demonstrate that our results can be extended to the directed setting by considering incoming directed trees instead.
- Published
- 2024
11. A virtually nilpotent group with non D-finite Green series
- Author
-
Bodart, Corentin
- Subjects
Mathematics - Group Theory ,Mathematics - Combinatorics ,Mathematics - Number Theory - Abstract
We provide an example of a virtually $2$-step nilpotent group, and a specific generating set, for which the Green series (sometimes called cogrowth series) is not D-finite. The proof relies on an arithmetical miracle, and the study of the subword complexity of a multiplicative sequence coming out of it., Comment: 11 pages, 2 figures. Comments are welcome
- Published
- 2024
12. Two-level D- and A-optimal main-effects designs with run sizes one and two more than a multiple of four
- Author
-
Hameed, Mohammed Saif Ismail, Ares, Jose Núñez, Schoen, Eric D., and Goos, Peter
- Subjects
Statistics - Methodology ,Mathematics - Combinatorics - Abstract
For run sizes that are a multiple of four, the literature offers many two-level designs that are D- and A-optimal for the main-effects model and minimize the aliasing between main effects and interaction effects and among interaction effects. For run sizes that are not a multiple of four, no conclusive results are known. In this paper, we propose two algorithms that generate all non-isomorphic D- and A-optimal main-effects designs for run sizes that are one and two more than a multiple of four. We enumerate all such designs for run sizes up to 18, report the numbers of designs we obtained, and identify those that minimize the aliasing between main effects and interaction effects and among interaction effects. Finally, we compare the minimally aliased designs we found with benchmark designs from the literature.
- Published
- 2024
13. Eccentricity Spectra and Integral Eigenvalues of Zero Divisor Graphs
- Author
-
Saharia, Gunajyoti, Dutta, Sanghita, and Dutta, Jibitesh
- Subjects
Mathematics - Spectral Theory ,Mathematics - Combinatorics ,05C25, 05C50, 05C75, 15A18 - Abstract
In this work, we study the eccentricity spectra of zero divisor graphs (ZDGs) associated with the ring $\mathbb{Z}_n.$ While previous studies have examined the Laplacian and distance Laplacian spectra of ZDGs, the eccentricity spectra have remained largely unknown due to the unique features of the eccentricity matrix. More specifically, we prove that for a prime $p$, the ZDG and extended ZDG of $\mathbb{Z}_{p^t}$ have integral eccentricity eigenvalues for $t \geq 3$ and $t \geq 2$, respectively. We also find the eccentricity spectra for specific classes of ZDGs and the relationship between the eccentricity matrix of these ZDGs and their tree structures using matrix analysis tools. In addition, for the usefulness of the energy gap in applications, we have calculated the eccentricity energy gap of ZDGs. These findings reveal interesting behaviours of the eccentricity matrix and may contribute to a more profound understanding of the structural properties of ZDGs., Comment: 30 pages, 6 figs. We welcome comments
- Published
- 2024
14. Frozen colourings in $2K_2$-free graphs
- Author
-
Belavadi, Manoj, Cameron, Kathie, and Hildred, Elias
- Subjects
Mathematics - Combinatorics ,0C15 - Abstract
The \emph{reconfiguration graph of the $k$-colourings} of a graph $G$, denoted $\mathcal{R}_k(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two vertices of $\mathcal{R}_k(G)$ are joined by an edge if the colourings of $G$ they correspond to differ in colour on exactly one vertex. A $k$-colouring of a graph $G$ is called \emph{frozen} if it is an isolated vertex in $\mathcal{R}_k(G)$; in other words, for every vertex $v \in V(G)$, $v$ is adjacent to a vertex of every colour different from its colour. A clique partition is a partition of the vertices of a graph into cliques. A clique partition is called a $k$-clique-partition if it contains at most $k$ cliques. Clearly, a $k$-colouring of a graph $G$ corresponds precisely to a $k$-clique-partition of its complement, $\overline{G}$. A $k$-clique-partition $\mathcal{Q}$ of a graph $H$ is called \emph{frozen} if for every vertex $v \in V(H)$, $v$ has a non-neighbour in each of the cliques of $\mathcal{Q}$ other than the one containing $v$. The cycle on four vertices, $C_4$, is sometimes called the \emph{square}; its complement is called $2K_2$. We give several infinite classes of $2K_2$-free graphs with frozen colourings. We give an operation which transforms a $k$-chromatic graph with a frozen $(k+1)$-colouring into a $(k+1)$-chromatic graph with a frozen $(k+2)$-colouring. Our operation preserves being $2K_2$-free. It follows that for all $k \ge 4$, there is a $k$-chromatic $2K_2$-free graph with a frozen $(k+1)$-colouring. We prove these results by studying frozen clique partitions in $C_4$-free graphs. We say a graph $G$ is \emph{recolourable} if $R_{\ell}(G)$ is connected for all $\ell$ greater than the chromatic number of $G$. We prove that every 3-chromatic $2K_2$-free graph is recolourable., Comment: 18 pages
- Published
- 2024
15. Note on a Coin Tossing Problem Posed by Daniel Litt
- Author
-
Levin, Bruce
- Subjects
Mathematics - Combinatorics ,60C05 - Abstract
We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over the other together with its increments as the number of coin tosses increases.
- Published
- 2024
16. On Oriented Colourings of Graphs on Surfaces
- Author
-
Clow, Alexander
- Subjects
Mathematics - Combinatorics ,05C15, 05C60 - Abstract
For an oriented graph $G$, the least number of colours required to oriented colour $G$ is called the oriented chromatic number of $G$ and denoted $\chi_o(G)$.For a non-negative integer $g$ let $\chi_o(g)$ be the least integer such that $\chi_o(G) \leq \chi_o(g)$ for every oriented graph $G$ with Euler genus at most $g$. We will prove that $\chi_o(g)$ is nearly linear in the sense that $\Omega(\frac{g}{\log(g)}) \leq \chi_o(g) \leq O(g \log(g))$. This resolves a question of the author, Bradshaw, and Xu, by improving their bounds of the form $\Omega((\frac{g^2}{\log(g)})^{1/3}) \leq \chi_o(g)$ and $\chi_o(g) \leq O(g^{6400})$., Comment: 14 pages, 2 figures
- Published
- 2024
17. Maximum shattering
- Author
-
Alon, Noga, Sivashankar, Varun, and Zhu, Daniel G.
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. What is the maximum possible number of subsets of $[n]$ of size $d$ that can be shattered by a family of size $k$? Denote this number by $f(n,k,d)$. We determine $f(n,2^d,d)$ precisely whenever $2^d-1$ divides $n$, showing that this number is $\frac{c_d}{d!}n^d$, where $c_d$ is the probability that $d$ independent uniformly random vectors in $\mathbb{F}_2^d \setminus \{0\}$ are linearly independent. We also show that if $d$ and $n$ grow, with both $d$ and $n-d$ tending to infinity, then $f(n,2^d,d)=(1+o(1))c\binom{n}{d}$, where $c$, roughly $0.289$, is the limit of $c_d$ as $d$ tends to infinity. The case $k>2^d$ is considered as well; for $d \leq 2$ we determine $f(n,k,d)$ precisely for all $n$ and $k$, but the case $d \geq 3$ and $k>2^d$ is much less understood., Comment: 12 pages, 2 figures
- Published
- 2024
18. Multiplicative recurrence of M\'obius transformations
- Author
-
Leung, Sun-Kai and Táfula, Christian
- Subjects
Mathematics - Number Theory ,Mathematics - Combinatorics ,Mathematics - Dynamical Systems ,05D10, 11B30, 11N37, 37A44 - Abstract
We provide a necessary and sufficient condition under which the set defined by a M\"obius transformation of positive integers is a set of multiplicative recurrence. A Khinchin-type lower bound is also established. This not only answers a question of Donoso--Le--Moreira--Sun but also strengthens their result. The key input in our proof is Tao's logarithmically averaged correlations of non-pretentious multiplicative functions., Comment: 10 pages
- Published
- 2024
19. On $e$-positivity of trees and connected partitions
- Author
-
Tom, Foster
- Subjects
Mathematics - Combinatorics ,05E05 (Primary) 05C05, 05C15 (Secondary) - Abstract
We prove that a tree with a vertex of degree at least five must be missing a connected partition of some type and therefore its chromatic symmetric function cannot be $e$-positive. We prove that this also holds for a tree with a vertex of degree four as long as it is not adjacent to any leaf. This brings us very close to the conjecture by Dahlberg, She, and van Willigenburg of non-$e$-positivity for all trees with a vertex of degree at least four. We also prove that spiders with four legs cannot have an $e$-positive chromatic symmetric function., Comment: 14 pages
- Published
- 2024
20. Higher-dimensional book-spaces
- Author
-
Aten, Charlotte
- Subjects
Mathematics - Rings and Algebras ,Mathematics - Combinatorics ,06B30, 57Q99 - Abstract
In 2017, Walter Taylor showed that there exist $2$-dimensional simplicial complexes which admit the structure of topological modular lattice but not topological distributive lattice. We give a positive answer to his question as to whether $n$-dimensional simplicial complexes with the same property exist. We do this by giving, for each $n\ge2$, an infinite family of compact simplicial complexes which admit the structure of topological modular lattice but not topological distributive lattice.
- Published
- 2024
21. Graphs with constant links and induced Tur\'an numbers
- Author
-
Caro, Yair, Hansberg, Adriana, and Tuza, Zsolt
- Subjects
Mathematics - Combinatorics ,05B05, 05B25, 05C35, 05C65 - Abstract
A graph $G$ of constant link $L$ is a graph in which the neighborhood of any vertex induces a graph isomorphic to $L$. Given two different graphs, $H$ and $G$, the induced Tur\'an number ${\rm ex}(n; H, G{\rm -ind})$ is defined as the maximum number of edges in an $n$-vertex graph having no subgraph isomorphic to $H$ and no copy from $G$ as an induced subgraph. Our main motivation in this paper is to establish a bridge between graphs with constant link and induced Tur\'an numbers via the class of $t$-regular, $k$-uniform (linear) hypergraphs of girth at least $4$, as well as to present several methods of constructing connected graphs with constant link. We show that, for integers $t \geq 3$ and $k \geq 3$, ${\rm ex}(n; C_k, K_{1,t}{\rm -ind}) \leq (k - 2)(t - 1)n/2$ and that equality holds for infinitely many values of $n$. This result is built upon the existence of graphs with constant link $tL$ with restricted cycle length, which we prove in another theorem. More precisely, we show that, given a graph $F$ with constant link $L$ and circumference $c$, then, for all integers $t \geq 2$ and $g > c$, there exists a graph with constant link $tL$ which is free of cycles of length $l$, for all $c < l < g$. We provide two proofs of this result using distinct approaches. We further present constructions of graphs with constant links $tL$, $t \geq 2$, and restricted cycle length based on Steiner Systems. Finally, starting from a connected graph of constant link $tL$, for $t \geq 2$, having order $n$ and restricted cycle lengths, we provide a method to construct an infinite collection of connected graphs of constant link $tL$ that preserves the cycle length restriction, and whose orders form an arithmetic progression $qn$, $q \geq 1$., Comment: 23 pages, 5 figures
- Published
- 2024
22. Dimension of Diophantine approximation and applications
- Author
-
Li, Longhui and Liu, Bochen
- Subjects
Mathematics - Classical Analysis and ODEs ,Mathematics - Combinatorics ,Mathematics - Number Theory - Abstract
In this paper we construct a new family of sets via Diophantine approximation, in which the classical examples are endpoints. Our first application is on their Hausdorff dimension. We show a recent result of Ren and Wang, known sharp on orthogonal projections in the plane, is also sharp on $A+cB$, $c\in C$, thus completely settle this ABC sum-product problem. Higher dimensional examples are also discussed. In addition to Hausdorff dimension, we also consider Fourier dimension. In particular, now for every $0\leq t\leq s\leq 1$ we have an explicit construction in $\mathbb{R}$ of Hausdorff dimension $s$ and Fourier dimension $t$, together with a measure $\mu$ that captures both dimensions. In the end we provide a perspective of Knapp's example and treat our Diophantine approximation as its analog in $\mathbb{R}$, that naturally leads to the sharpness of Mockenhaupt-Mitsis-Bak-Seeger Fourier restriction theorem. These are alternatives of recent examples due to Fraser-Hambrook-Ryou. In particular, to deal with the non-geometric case we construct measures of "Hausdorff dimension" $a$ and Fourier dimension $b$, even if $a
- Published
- 2024
23. Enumeration of weighted quadrant walks: criteria for algebraicity and D-finiteness
- Author
-
Dreyfus, Thomas, Price, Andrew Elvey, and Raschel, Kilian
- Subjects
Mathematics - Combinatorics - Abstract
In the field of enumeration of weighted walks confined to the quarter plane, it is known that the generating functions behave very differently depending on the chosen step set; in practice, the techniques used in the literature depend on the complexity of the counting series. In this paper we introduce a unified approach based on the theory of elliptic functions, which allows us to have a common proof of the characterisation of the algebraicity and D-finiteness of the generating functions.
- Published
- 2024
24. Exact Values and Bounds for Ramsey Numbers of $C_4$ Versus a Star Graph
- Author
-
Boza, Luis
- Subjects
Mathematics - Combinatorics ,05C55 ,G.2.2 - Abstract
The 8 unknown values of the Ramsey numbers $R(C_4,K_{1,n})$ for $n \leq 37$ are determined, showing that $R(C_4,K_{1,27}) = 33$ and $R(C_4,K_{1,n}) = n + 7$ for $28 \leq n \leq 33$ or $n = 37$. Additionally, the following results are proven: $\bullet$ If $n$ is even and $\lceil\sqrt{n}\rceil$ is odd, then $R(C_4,K_{1,n}) \leq n + \left\lceil\sqrt{n-\lceil\sqrt{n}\rceil+2}\right\rceil + 1$. $\bullet$ If $m \equiv 2 \,(\text{mod } 6)$ with $m \geq 8$, then $R(C_4,K_{1,m^2+3}) \leq m^2 + m + 4$. $\bullet$ If $R(C_4,K_{1,n}) > R(C_4,K_{1,n-1})$, then $R(C_4,K_{1,2n+1-R(C_4,K_{1,n})}) \geq n$.
- Published
- 2024
25. List Conflict-free Coloring
- Author
-
Gupta, Shiwali and Mathew, Rogers
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15, 05C35, 05D40 ,G.2.2 ,G.2.1 - Abstract
Motivated by its application in the frequency assignment problem for cellular networks, conflict-free coloring was first studied by Even et al. in [Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks, SIAM Journal on Computing, 2004]. A \emph{conflict-free coloring} of a hypergraph $\mathcal{H}$ is an assignment of colors to the vertex set of $\mathcal{H}$ such that every hyperedge in $\mathcal{H}$ has a vertex whose color is distinct from every other vertex in that hyperedge. The minimum number of colors required for such a coloring is known as the \emph{conflict-free chromatic number} of $\mathcal{H}$. Conflict-free coloring has also been studied on open/closed neighborhood hypergraphs of a given graph. In this paper, we study the list variant of conflict-free coloring where, for every vertex $v$, we are given a list of admissible colors $L_v$ such that $v$ is allowed to be colored only from $L_v$. We prove upper bounds for the list conflict-free chromatic number of general hypergraphs and graphs., Comment: 17 pages
- Published
- 2024
26. Keys and Evacuation via Virtualization
- Author
-
Azenhas, Olga, González, Nicolle, Huang, Daoji, and Torres, Jacinta
- Subjects
Mathematics - Combinatorics ,Mathematics - Representation Theory ,05E10, 05E05, 17B3 - Abstract
We prove that the key map on crystals can be reduced to the simply-laced types by using virtualization of crystals. For this we use the original definition of virtualization coming from the dilation of crystals by Kashiwara. As a direct application we obtain algorithms to compute orthogonal evacuation, keys and Demazure atoms in type B in terms of Kasiwara-Nakashima tableaux. In particular, we are able to use type A and C methods. For type C, we apply the results obtained by Azenhas-Tarighat Feller-Torres, Azenhas-Santos and Santos., Comment: 25 pages, comments welcome
- Published
- 2024
27. A topological proof of the Hell-Ne\v{s}et\v{r}il dichotomy
- Author
-
Meyer, Sebastian and Opršal, Jakub
- Subjects
Computer Science - Computational Complexity ,Mathematics - Algebraic Topology ,Mathematics - Combinatorics - Abstract
We provide a new proof of a theorem of Hell and Ne\v{s}et\v{r}il [J. Comb. Theory B, 48(1):92-110, 1990] using tools from topological combinatorics based on ideas of Lov\'asz [J. Comb. Theory, Ser. A, 25(3):319-324, 1978]. The Hell-Ne\v{s}et\v{r}il Theorem provides a dichotomy of the graph homomorphism problem. It states that deciding whether there is a graph homomorphism from a given graph to a fixed graph $H$ is in P if $H$ is bipartite (or contains a self-loop), and is NP-complete otherwise. In our proof we combine topological combinatorics with the algebraic approach to constraint satisfaction problem., Comment: 13 pages
- Published
- 2024
28. Sharp estimates for Gowers norms on discrete cubes
- Author
-
Crmarić, Tonći and Kovač, Vjekoslav
- Subjects
Mathematics - Combinatorics ,Computer Science - Information Theory ,Mathematics - Classical Analysis and ODEs - Abstract
We study optimal dimensionless inequalities $$ \|f\|_{U^k} \leq \|f\|_{\ell^{p_{k,n}}} $$ that hold for all functions $f\colon\mathbb{Z}^d\to\mathbb{C}$ supported in $\{0,1,\ldots,n-1\}^d$ and estimates $$ \|1_A\|_{U^k}^{2^k}\leq |A|^{t_{k,n}} $$ that hold for all subsets $A$ of the same discrete cubes. A general theory, analogous to the work of de Dios Pont, Greenfeld, Ivanisvili, and Madrid, is developed to show that the critical exponents are related by $p_{k,n} t_{k,n} = 2^k$. This is used to prove the three main results of the paper: an explicit formula for $t_{k,2}$, which generalizes a theorem by Kane and Tao, two-sided asymptotic estimates for $t_{k,n}$ as $n\to\infty$ for a fixed $k\geq2$, which generalize a theorem by Shao, and a precise asymptotic formula for $t_{k,n}$ as $k\to\infty$ for a fixed $n\geq2$., Comment: 22 pages, Mathematica notebook attached
- Published
- 2024
29. Universal partial tori
- Author
-
Carey, William D., Kearney, Matthew, Kirsch, Rachel, and Popescu, Stefan
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05A05, 68R15 - Abstract
A De Bruijn cycle is a cyclic sequence in which every word of length $n$ over an alphabet $\mathcal{A}$ appears exactly once. De Bruijn tori are a two-dimensional analogue. Motivated by recent progress on universal partial cycles and words, which shorten De Bruijn cycles using a wildcard character, we introduce universal partial tori and matrices. We find them computationally and construct infinitely many of them using one-dimensional variants of universal cycles, including a new variant called a universal partial family., Comment: 22 pages, 1 figure
- Published
- 2024
30. Polynomials Counting Group Colorings in Graphs
- Author
-
Fu, Houshan
- Subjects
Mathematics - Combinatorics ,05C31, 05C15 - Abstract
Jaeger et al. in 1992 introduced group coloring as the dual concept to group connectivity in graphs. Let $\Gamma$ be an Abelian group, $ f: E(G)\to\Gamma$ and $D$ an orientation of a graph $G$. A vertex coloring $c:V(G)\to\Gamma$ is a $(\Gamma, f)$-coloring if $c(v)-c(u)\ne f(e)$ for each edge $e=uv$ and the corresponding arc $D(e)=(u,v)$ directed from $u$ to $v$. We introduce the concept of $\alpha$-compatible graphs and define the cycle-assigning polynomial $P(G, \alpha; k)$ at $k$ in terms of $\alpha$-compatible spanning subgraphs, where $\alpha$ is an assigning of $G$ from its cycles to $\{0,1\}$. We prove that the cycle-assigning polynomial $P(G,\alpha;k)$ equals the number of $(\Gamma,f)$-colorings for any Abelian group $\Gamma$ of order $k$ and $f:E(G)\to\Gamma$ such that the assigning $\alpha_{D,f}$ induced by $f$ equals $\alpha$. In particular, $P(G,\alpha;k)$ is the classical chromatic polynomial if $\alpha(C)=0$ for any cycle $C$ of $G$. Furthermore, we introduce the concept of $\alpha$-compatible broken cycles and interpret $P(G,\alpha;k)$ in terms of $\alpha$-compatible spanning subgraphs that do not contain $\alpha$-compatible broken cycles. This implies that the absolute value of the coefficient of $k^{r(G)-i}$ in $P(G,\alpha;k)$ equals the number of $\alpha$-compatible spanning subgraphs that have $i$ edges and contain no $\alpha$-compatible broken cycles, which generalizes the Whitney's Broken Cycle Theorem. Based on the combinatorial explanation, we establish a unified order-preserving relation from assignings to cycle-assigning polynomials. Finally, we show that for any loopless graphs $G$, the coefficients of the cycle-assigning polynomial $P(G,\alpha;k)$ are nonzero and alternate in sign, and further conjecture that the sequence of absolute values of its coefficients is unimodal and log-concave., Comment: 14pages
- Published
- 2024
31. Condorcet cycle elections with influential voting blocs
- Author
-
Gendler, Gabriel
- Subjects
Mathematics - Combinatorics ,06E30, 91B14 - Abstract
A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the MIIA condition, and respects the complete anonymity of each voter, then it must be a Borda election, where each voter assigns two points to their preferred candidate, one to their second preference and none to their least preferred candidate. We introduce a relaxed anonymity condition called ``transitive anonymity'', whereby a group $G$ acting transitively on the set of voters $V$ maintains the outcome of the SWF. Elections across multiple constituencies of equal size are common examples of elections with transitive anonymity but without full anonymity. First, we demonstrate that under this relaxed anonymity condition, non-Borda elections do exist. On the other hand, by modifying Kalai's proof of Arrow's Impossibility Theorem, which employs methods from the analysis of Boolean functions, we show that this can only occur when the number of voters is not a multiple of three, and we demonstrate that even these non-Borda elections are very close to being Borda., Comment: 30 pages
- Published
- 2024
32. Anzahl theorems for disjoint subspaces generating a non-degenerate subspace II: quadratic forms
- Author
-
De Boeck, Maarten and Van de Voorde, Geertrui
- Subjects
Mathematics - Combinatorics ,51A50, 51E20 - Abstract
In this paper, we solve a classical counting problem for non-degenerate quadratic forms defined on a vector space in odd characteristic; given a subspace $\pi$, we determine the number of non-singular subspaces that are trivially intersecting with $\pi$ and span a non-singular subspace with $\pi$. Lower bounds for the quantity of such pairs where $\pi$ is non-singular were first studied in `Glasby, Niemeyer, Praeger (Finite Fields Appl., 2022)', which was later improved for even-dimensional subspaces in `Glasby, Ihringer, Mattheus (Des. Codes Cryptogr., 2023)' and generalised in `Glasby, Niemeyer, Praeger (Linear Algebra Appl., 2022)'. The explicit formulae, which allow us to give the exact proportion and improve the known lower bounds were derived in the symplectic and Hermitian case in `De Boeck and Van de Voorde (Linear Algebra Appl. 2024)'. This paper deals with the more complicated quadratic case.
- Published
- 2024
33. Lattice polytopes with the minimal volume
- Author
-
Hamano, Ginji, Sainose, Ichiro, and Hibi, Takayuki
- Subjects
Mathematics - Combinatorics - Abstract
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$. It follows from the lower bound theorem of Ehrhart polynomials that, when $c > 0$, \[ {\rm vol}(\mathcal{P}) \geq (d \cdot c(\mathcal{P}) + (d-1) \cdot b(\mathcal{P}) - d^2 + 2)/d!, \] where ${\rm vol}(\mathcal{P})$ is the (Lebesgue) volume of $\mathcal{P}$. Pick's formula guarantees that, when $d = 2$, the above inequality is an equality. In the present paper several classes of lattice polytopes for which the equality here holds will be presented.
- Published
- 2024
34. A note on connectivity in directed graphs
- Author
-
Stylianou, Stelios
- Subjects
Mathematics - Combinatorics - Abstract
We say a directed graph $G$ on $n$ vertices is irredundant if the removal of any edge reduces the number of ordered pairs of distinct vertices $(u,v)$ such that there exists a directed path from $u$ to $v$. We determine the maximum possible number of edges such a graph can have, for every $n \in \mathbb{N}$. We also characterize the cases of equality. This resolves, in a strong form, a question of Crane and Russell., Comment: 4 pages
- Published
- 2024
35. The repetition threshold for ternary rich words
- Author
-
Currie, James D., Mol, Lucas, and Peltomäki, Jarkko
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,Computer Science - Formal Languages and Automata Theory ,68R15 - Abstract
In 2014, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length $n$ contain $n$ distinct nonempty palindromic factors. In 2020, Currie, Mol, and Rampersad proved a conjecture of Baranwal and Shallit that the repetition threshold for binary rich words is $2 + \sqrt{2}/2$. In this paper, we prove a structure theorem for $16/7$-power-free ternary rich words. Using the structure theorem, we deduce that the repetition threshold for ternary rich words is $1 + 1/(3 - \mu) \approx 2.25876324$, where $\mu$ is the unique real root of the polynomial $x^3 - 2x^2 - 1$., Comment: 60 pages
- Published
- 2024
36. Proof of a conjecture on graph polytope
- Author
-
Liu, Feihu
- Subjects
Mathematics - Combinatorics - Abstract
The graph polytopes arising from the vertex weighted graph, which was first introduced and studied by B\'ona, Ju, and Yoshida. A conjecture states that for a simple connected graph, the polynomial in the numerator of the Ehrhart series is palindromic. We confirm the conjecture. Furthermore, we introduce the hypergraph polytope. We prove that the simple connected unimodular hypergraph polytopes are integer polytopes. We also prove the polynomial in the numerator of the Ehrhart series of simple connected uniform hypergraph polytopes is palindromic., Comment: 8 pages, 2 figures
- Published
- 2024
37. Generalized Andr\'{a}sfai--Erd\H{o}s--S\'{o}s theorems for odd cycles
- Author
-
Chen, Zian, Hou, Jianfeng, Hu, Caiyun, and Liu, Xizhi
- Subjects
Mathematics - Combinatorics - Abstract
In this note, we establish Andr\'{a}sfai--Erd\H{o}s--S\'{o}s-type stability theorems for two generalized Tur\'{a}n problems involving odd cycles, both of which are extensions of the Erd\H{o}s Pentagon Problem. Our results strengthen previous results by Lidick\'{y}--Murphy~\cite{LM21} and Beke--Janzer~\cite{BJ24}, while also simplifying parts of their proofs., Comment: short note, comments are welcome
- Published
- 2024
38. Isomorphisms of bi-Cayley graphs on generalized quaternion groups
- Author
-
Xie, Jin-Hua
- Subjects
Mathematics - Combinatorics ,05C25, 20B25 - Abstract
Let $m$ be a positive integer. A group $G$ is said to be an $m$-BCI-group if $G$ has the $k$-BCI property for all positive integers $k$ at most $m$. Let $G$ be a generalized quaternion group of order $4n$ with $n\geq 2$. It is shown that $G$ is a 3-BCI-group if and only if $G$ is a $2$-BCI-group if and only if $n=2$ or $n$ is odd., Comment: 14
- Published
- 2024
39. Variations on Bollob\'{a}s systems of $d$-partitions
- Author
-
Fang, Yu, Wang, Xiaomiao, and Feng, Tao
- Subjects
Mathematics - Combinatorics - Abstract
This paper investigates five kinds of systems of $d$-partitions of $[n]$, including symmetric Bollob\'{a}s systems, strong Bollob\'{a}s systems, Bollob\'{a}s systems, skew Bollob\'{a}s systems, and weak Bollob\'{a}s systems. Many known results on variations of Bollob\'{a}s systems are unified. Especially we give a negative answer to a conjecture on Bollob\'{a}s systems of $d$-partitions of $[n]$ that was presented by Heged\"{u}s and Frankl [European J. Comb., 120 (2024), 103983]. Even though this conjecture does not hold for general Bollob\'{a}s systems, we show that it holds for strong Bollob\'{a}s systems of $d$-partitions of $[n]$.
- Published
- 2024
40. Abelian and stochastic sandpile models on complete bipartite graphs
- Author
-
Selig, Thomas and Zhu, Haoyue
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,Mathematics - Probability ,05A19 (Primary) 05A15, 05B50, 60J10 (Secondary) - Abstract
In the sandpile model, vertices of a graph are allocated grains of sand. At each unit of time, a grain is added to a randomly chosen vertex. If that causes its number of grains to exceed its degree, that vertex is called unstable, and topples. In the Abelian sandpile model (ASM), topplings are deterministic, whereas in the stochastic sandpile model (SSM) they are random. We study the ASM and SSM on complete bipartite graphs. For the SSM, we provide a stochastic version of Dhar's burning algorithm to check if a given (stable) configuration is recurrent or not, with linear complexity. We also exhibit a bijection between sorted recurrent configurations and pairs of compatible Ferrers diagrams. We then provide a similar bijection for the ASM, and also interpret its recurrent configurations in terms of labelled Motzkin paths., Comment: 19 pages, 9 figures
- Published
- 2024
41. Colouring the 1-skeleton of $d$-dimensional triangulations
- Author
-
Planken, Tim
- Subjects
Mathematics - Combinatorics ,Mathematics - Algebraic Topology ,05C15 (Primary), 05E45, 05C10 (Secondary) - Abstract
While every plane triangulation is colourable with three or four colours, Heawood showed that a plane triangulation is 3-colourable if and only if every vertex has even degree. In $d \geq 3$ dimensions, however, every $k \geq d+1$ may occur as the chromatic number of some triangulation of ${\mathbb S}^d$. As a first step, Joswig structurally characterised which triangulations of ${\mathbb S}^d$ have a $(d+1)$-colourable 1-skeleton. In the 20 years since Joswig's result, no characterisations have been found for any $k>d+1$. In this paper, we structurally characterise which triangulations of ${\mathbb S}^d$ have a $(d+2)$-colourable 1-skeleton: they are precisely the triangulations that have a subdivision such that for every $(d-2)$-cell, the number of incident $(d-1)$-cells is divisible by three., Comment: 17 pages, 2 figures
- Published
- 2024
42. A sufficient condition for pancyclic graphs
- Author
-
Zhan, Xingzhi
- Subjects
Mathematics - Combinatorics ,05C38, 05C42, 05C45, 05C75 - Abstract
A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t.$ We prove that every $2$-connected $[4,2]$-graph of order at least $7$ is pancyclic. This strengthens existing results. There are $2$-connected $[4,2]$-graphs which do not satisfy the Chv\'{a}tal-Erd\H{o}s condition. We also determine the triangle-free graphs among $[p+2,p]$-graphs for a general $p.$, Comment: 9 pages, 3 figures
- Published
- 2024
43. Furstenberg set problem and exceptional set estimate in prime fields: dimension two implies higher dimensions
- Author
-
Gan, Shengwen
- Subjects
Mathematics - Classical Analysis and ODEs ,Mathematics - Combinatorics - Abstract
We study Furstenberg set problem, and exceptional set estimate for Marstrand's orthogonal projection in prime fields for all dimensions. We define the Furstenberg index $\mathbf{F}(s,t;n,k)$ and the Marstrand index $\mathbf{M}(a,s;n,k)$. It is shown that the two-dimensional result for Furstenberg set problem implies all higher dimensional results., Comment: 48 pages, 2 figures
- Published
- 2024
44. The Moran process on a random graph
- Author
-
Frieze, Alan and Pegden, Wesley
- Subjects
Mathematics - Probability ,Mathematics - Combinatorics - Abstract
We study the fixation probability for two versions of the Moran process on the random graph $G_{n,p}$ at the threshold for connectivity. The Moran process models the spread of a mutant population in a network. Throughtout the process there are vertices of two types, mutants and non-mutants. Mutants have fitness $s$ and non-mutants have fitness 1. The process starts with a unique individual mutant located at the vertex $v_0$. In the Birth-Death version of the process a random vertex is chosen proportional to its fitness and then changes the type of a random neighbor to its own. The process continues until the set of mutants $X$ is empty or $[n]$. In the Death-Birth version a uniform random vertex is chosen and then takes the type of a random neighbor, chosen according to fitness. The process again continues until the set of mutants $X$ is empty or $[n]$. The {\em fixation probability} is the probability that the process ends with $X=\emptyset$. We give asymptotically correct estimates of the fixation probability that depend on degree of $v_0$ and its neighbors.
- Published
- 2024
45. Cops against a cheating robber
- Author
-
Clarke, Nancy E., Dyer, Danny, and Kellough, William
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C57 (Primary), 91A43 (Secondary) - Abstract
We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer to this game as Cops and Cheating Robot. The cheating robot number for a graph is the fewest number of cops needed to win on the graph. We introduce a new parameter for this variation, called the push number, which gives the value for the minimum number of cops that move onto the robber's vertex given that there are a cheating robot number of cops on the graph. After producing some elementary results on the push number, we use it to give a relationship between Cops and Cheating Robot and Surrounding Cops and Robbers. We investigate the cheating robot number for planar graphs and give a tight bound for bipartite planar graphs. We show that determining whether a graph has a cheating robot number at most fixed $k$ can be done in polynomial time. We also obtain bounds on the cheating robot number for strong and lexicographic products of graphs., Comment: 27 pages, 4 figures
- Published
- 2024
46. On the off-diagonal unordered Erd\H{o}s-Rado numbers
- Author
-
Araujo, Igor and Peng, Dadong
- Subjects
Mathematics - Combinatorics - Abstract
Erd\H{o}s and Rado [P. Erd\H{o}s, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249-255] introduced the Canonical Ramsey numbers $\text{er}(t)$ as the minimum number $n$ such that every edge-coloring of the ordered complete graph $K_n$ contains either a monochromatic, rainbow, upper lexical, or lower lexical clique of order $t$. Richer [D. Richer, Unordered canonical Ramsey numbers, Journal of Combinatorial Theory Series B 80 (2000) 172-177] introduced the unordered asymmetric version of the Canonical Ramsey numbers $\text{CR}(s,r)$ as the minimum $n$ such that every edge-coloring of the (unorderd) complete graph $K_n$ contains either a rainbow clique of order $r$, or an orderable clique of order $s$. We show that $\text{CR}(s,r) = O(r^3/\log r)^{s-2}$, which, up to the multiplicative constant, matches the known lower bound and improves the previously best known bound $\text{CR}(s,r) = O(r^3/\log r)^{s-1}$ by Jiang [T. Jiang, Canonical Ramsey numbers and proporly colored cycles, Discrete Mathematics 309 (2009) 4247-4252]. We also obtain bounds on the further variant $\text{ER}(m,\ell,r)$, defined as the minimum $n$ such that every edge-coloring of the (unorderd) complete graph $K_n$ contains either a monochromatic $K_m$, lexical $K_\ell$, or rainbow $K_r$., Comment: 8 pages, no figures
- Published
- 2024
47. Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
- Author
-
Kurapov, Sergey, Davidovsky, Maxim, and Polyuga, Svetlana
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics - Abstract
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle based on ring summation of isometric cycles of a graph is presented. Based on the matrix of distances between vertices, the weight of each cycle is determined as an additive sum of the weights of its edges. To construct an optimal route of a graph, the basic idea of finding an optimal route between four vertices is used. Further successive constructions are aimed at joining an adjacent isometric cycle with an increase in the number of vertices by one unit. The recursive process continues until all vertices of the graph are connected. Based on the introduced mathematical apparatus, the monography presents a new algorithm for solving the symmetric Traveling salesman problem. Some examples of solving the problem are provided., Comment: 46 pages, 32 figures, a preprint of monography, in Ukrainian language
- Published
- 2024
48. Multiprojective Seshadri stratifications for Schubert varieties and standard monomial theory
- Author
-
Müller, Henrik
- Subjects
Mathematics - Algebraic Geometry ,Mathematics - Combinatorics ,Mathematics - Representation Theory - Abstract
Using the language of Seshadri stratifications we develop a geometrical interpretation of Lakshmibai-Seshadri-tableaux and their associated standard monomial bases. These tableaux are a generalization of Young-tableaux and De-Concini-tableaux to all Dynkin types. More precisely, we construct filtrations of multihomogeneous coordinate rings of Schubert varieties, such that the subquotients are one-dimensional and indexed by standard tableaux., Comment: 58 pages, comments are welcome
- Published
- 2024
49. Edge spectra of Gaussian random symmetric matrices with correlated entries
- Author
-
Banerjee, Debapratim, Mukherjee, Soumendu Sundar, and Pal, Dipranjan
- Subjects
Mathematics - Probability ,Mathematical Physics ,Mathematics - Combinatorics ,Mathematics - Statistics Theory - Abstract
We study the largest eigenvalue of a Gaussian random symmetric matrix $X_n$, with zero-mean, unit variance entries satisfying the condition $\sup_{(i, j) \ne (i', j')}|\mathbb{E}[X_{ij} X_{i'j'}]| = O(n^{-(1 + \varepsilon)})$, where $\varepsilon > 0$. It follows from Catalano et al. (2024) that the empirical spectral distribution of $n^{-1/2} X_n$ converges weakly almost surely to the standard semi-circle law. Using a F\"{u}redi-Koml\'{o}s-type high moment analysis, we show that the largest eigenvalue $\lambda_1(n^{-1/2} X_n)$ of $n^{-1/2} X_n$ converges almost surely to $2$. This result is essentially optimal in the sense that one cannot take $\varepsilon = 0$ and still obtain an almost sure limit of $2$. We also derive Gaussian fluctuation results for the largest eigenvalue in the case where the entries have a common non-zero mean. Let $Y_n = X_n + \frac{\lambda}{\sqrt{n}}\mathbf{1} \mathbf{1}^\top$. When $\varepsilon \ge 1$ and $\lambda \gg n^{1/4}$, we show that \[ n^{1/2}\bigg(\lambda_1(n^{-1/2} Y_n) - \lambda - \frac{1}{\lambda}\bigg) \xrightarrow{d} \sqrt{2} Z, \] where $Z$ is a standard Gaussian. On the other hand, when $0 < \varepsilon < 1$, we have $\mathrm{Var}(\frac{1}{n}\sum_{i, j}X_{ij}) = O(n^{1 - \varepsilon})$. Assuming that $\mathrm{Var}(\frac{1}{n}\sum_{i, j} X_{ij}) = \sigma^2 n^{1 - \varepsilon} (1 + o(1))$, if $\lambda \gg n^{\varepsilon/4}$, then we have \[ n^{\varepsilon/2}\bigg(\lambda_1(n^{-1/2} Y_n) - \lambda - \frac{1}{\lambda}\bigg) \xrightarrow{d} \sigma Z. \] While the ranges of $\lambda$ in these fluctuation results are certainly not optimal, a striking aspect is that different scalings are required in the two regimes $0 < \varepsilon < 1$ and $\varepsilon \ge 1$., Comment: 23 pages, 2 figures
- Published
- 2024
50. Burning game
- Author
-
Chiarelli, Nina, Iršič, Vesna, Jakovac, Marko, Kinnersley, William B., and Mikalački, Mirjana
- Subjects
Mathematics - Combinatorics ,05C57 - Abstract
Motivated by the burning and cooling processes, the burning game is introduced. The game is played on a graph $G$ by the two players (Burner and Staller) that take turns selecting vertices of $G$ to burn; as in the burning process, burning vertices spread fire to unburned neighbors. Burner aims to burn all vertices of $G$ as quickly as possible, while Staller wants the process to last as long as possible. If both players play optimally, then the number of time steps needed to burn the whole graph $G$ is the game burning number $b_g(G)$ if Burner makes the first move, and the Staller-start game burning number $b_g'(G)$ if Staller starts. In this paper, basic bounds on $b_g(G)$ are given and Continuation Principle is established. Graphs with small game burning numbers are characterized and Nordhaus-Gaddum type results are obtained. An analogue of the burning number conjecture for the burning game is considered and graph products are studied.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.