# Mathematics - Combinatorics Publications (50)

## Search

## Mathematics - Combinatorics Publications

In 1996, Michael Stiebitz proved that if $G$ is a simple graph with $\delta(G)\geq s+t+1$ and $s,t\in \ganzo$, then $V(G)$ can be partitioned into two sets $A$ and $B$ such that $\delta(G[A])\geq s$ and $\delta(G[B])\geq t$. In 2016, Amir Ban proved a similar result for weighted graphs. Let $G$ be a simple graph with at least two vertices, let $w:E(G) \to \real_{>0}$ be a weight function, let $s,t \in \real_{\geq 0}$, and let $W=\max_{e\in E(G)} w(e)$. Read More

A graph $G$ belongs to the class ${\rm ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,{\cal S})$, where $T$ is a tree of maximum degree at most $h$, and ${\cal S}$ is a collection $(S_u)_{u\in V(G)}$ of subtrees $S_u$ of maximum degree at most $s$ of $T$, one for each vertex $u$ of $G$, such that, for every vertex $u$ of $G$, all leaves of $S_u$ are also leaves of $T$, and, for every two distinct vertices $u$ and $v$ of $G$, the following three properties are equivalent: (i) $u$ and $v$ are adjacent. (ii) $S_u$ and $S_v$ have at least $t$ vertices in common. (iii) $S_u$ and $S_v$ share a leaf of $T$. Read More

In this paper, we compute the expectation of traces of powers of the hermitian matrix Jacobi process for a large enough but fixed size. To proceed, we first derive the semi-group density of its eigenvalues process as a bilinear series of symmetric Jacobi polynomials. Next, we use the expansion of power sums in the Schur polynomial basis and the integral Cauchy-Binet formula in order to determine the partitions having non zero contributions after integration. Read More

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called \emph{excited diagrams}, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall.\\ In this paper, we present a simple bijection that proves an equivalent recursive version of Naruse's result, in the same way that the celebrated hook-walk proof due to Green, Nijenhuis and Wilf gives a bijective (or probabilistic) proof of the hook-length formula for ordinary shapes. Read More

In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain complex, and Laplacian operates this defferential forms. Then we construct the Bochner-Weitzenb\"ock formula and define the Ricci curvature. Read More

Let G be a simple connected molecular graph with vertex set $V(G)$ and edge set $E(G)$. One important modification of classical Zagreb index, called hyper Zagreb index $HM(G)$ is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms $[{d_G}(u)+{d_G}(v)]^2$ over all the edges of $G$, where ${d_G}(u)$ denote the degree of the vertex $u$ of $G$. In this paper, the hyper Zagreb index of certain bridge and chain graphs are computed and hence using the derived results we compute the hyper Zagreb index of several classes of chemical graphs and nanostructures. Read More

A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts arc-transitively on the regular cover. In this paper, we give a classification of arc-transitive cyclic and dihedral covers of a connected pentavalent symmetric graph of order twice a prime. All those covers are explicitly constructed as Cayley graphs on some groups, and their full automorphism groups are determined. Read More

For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The motivation for studying this problem comes from the theory of partial spreads, or subspace codes with the highest possible minimum distance, since the set of holes of a partial spread of $r$-flats in $\operatorname{PG}(v-1,\mathbb{F}_q)$ corresponds to a $q^r$-divisible code with $k\leq v$. In this paper we provide an introduction to this problem and report on new results for $q=2$. Read More

Building on recent work of Dvo\v{r}\'ak and Yepremyan, we show that every simple graph of minimum degree $7t+7$ contains $K_t$ as an immersion and that every graph with chromatic number at least $3.54t + 4$ contains $K_t$ as an immersion. We also show that every graph on $n$ vertices with no stable set of size three contains $K_{2\lfloor n/5 \rfloor}$ as an immersion. Read More

A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). Read More

In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that \v{C}ern\'y's conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3-directing word is equal to the Pin-Frankl bound for DFAs. As a second consequence, for several classes of CNFAs sharper bounds are established. Read More

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which coincides with $f$. We call it the minimal polynomial of $f$. Read More

A Cayley graph for a group $G$ is CCA if every automorphism of the graph that preserves the edge-orbits under the regular representation of $G$ is an element of the normaliser of $G$. A group $G$ is then said to be CCA if every connected Cayley graph on $G$ is CCA. We show that a finite simple group is CCA if and only if it has no element of order 4. Read More

A classic result of Asplund and Gr\"unbaum states that intersection graphs of axis-aligned rectangles in the plane are $\chi$-bounded. This theorem can be equivalently stated in terms of path-decompositions as follows: There exists a function $f:\mathbb{N}\to\mathbb{N}$ such that every graph that has two path-decompositions such that each bag of the first decomposition intersects each bag of the second in at most $k$ vertices has chromatic number at most $f(k)$. Recently, Dujmovi\'c, Joret, Morin, Norin, and Wood asked whether this remains true more generally for two tree-decompositions. Read More

The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation is the generic completion rank introduced by Uhler. We show that the maximum likelihood threshold and the generic completion rank behave in the same way under clique sums, which gives us large families of graphs on which these invariants coincide. Read More

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of minimal $t$-fold blocking sets in finite projective planes and it generalizes the classical result of Bruen and Thas on minimal blocking sets. We also show that if equality occurs in this bound then every line intersects $S$ in either $t$ points or $\frac{1}{2}(\sqrt{4tn - (3t + 1)(t - 1)} + t - 1) + 1$ points. Read More

The special limit of the Totaly Asymmetric Zero Range Process of the low dimensional non-equilibrium statistical mechanics described by the non-Hermitian Hamiltonian is considered. The calculation of the conditional probabilities of the model are based on the algebraic Bethe Ansatz approach. We demonstrate that the conditional probabilities may be considered as the generating functions of the random multi-dimensional lattice walks bounded by a hyperplane. Read More

In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. Read More

We present an extended worked example of the computation of the tropical superpotential considered by Carl--Pumperla--Siebert [8]. In particular we consider an affine manifold associated to the complement of a non-singular genus one plane curve and calculate the wall and chamber decomposition determined by the Gross--Siebert algorithm. Using results of [8] we determine the tropical superpotential, via broken line counts, in every chamber of this decomposition. Read More

It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a shortest synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all DFAs reaching this bound was only given for $n \leq 4$, and with bounds on the number of symbols for $n \leq 10$. Here we give the full analysis for $n \leq 6$, without bounds on the number of symbols. Read More

The $g$-good-neighbor conditional diagnosability is a new measure for fault diagnosis of systems. Xu et al. [Theor. Read More

The main purpose of the present paper is to establish a link between quadrature surfaces (potential theoretic concept) and sandpile dynamics (Laplacian growth models). For this aim, we introduce a new model of Laplacian growth on the lattice $\mathbb{Z}^d$ $(d\geq 2)$ which continuously deforms occupied regions of the \emph{divisible sandpile} model of Levine and Peres, by redistributing the total mass of the system onto $\frac 1m$-sub-level sets of the odometer which is a function counting total emissions of mass from lattice vertices. In free boundary terminology this goes in parallel with singular perturbation, which is known to converge to a Bernoulli type free boundary. Read More

These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. Read More

Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity blocks. Motivated by his work, we investigate partitions with prescribed successive rank parity blocks. Read More

We study asymptotics of $q$-distributed random lozenge tilings of sawtooth domains (equivalently, of random interlacing integer arrays with fixed top row). Under the distribution we consider each tiling is weighted proportionally to $q^{\mathsf{vol}}$, where $\mathsf{vol}$ is the volume under the corresponding 3D stepped surface. We prove the following Interlacing Central Limit Theorem: as $q\rightarrow1$, the domain gets large, and the fixed top row approximates a given nonrandom profile, the vertical lozenges are distributed as the eigenvalues of a GUE random matrix and of its successive principal corners. Read More

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a corollary to the result that generalized dual equivalence classes of permutations are unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author. Read More

In this paper we introduce a new variant for the p-median facility location problem in which it is assumed that the exact position of the potential facilities is unknown. Instead, each of the facilities must belong to a convex region around their initial estimated positions. In this problem, two main decisions have to be made simultaneously: the determination of the potential facilities that must be opened to serve the demands of the customers and the location of the open facilities into their neighborhoods, at global minimum cost. Read More

Graph spanners have been studied extensively, and have many applications in algorithms, distributed systems, and computer networks. For many of these application, we want distributed constructions of spanners, i.e. Read More

We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every polycyclic non-virtually-nilpotent group has NP-complete subset sum problem. Read More

We study a one dimensional directed polymer model in an inverse-gamma random environment, known as the log-gamma polymer, in three different geometries: point-to-line, point-to-half line and when the polymer is restricted to a half space with end point lying free on the corresponding half line.Via the use of A.N. Read More

**Affiliations:**

^{1}JAD,

^{2}JAD

In recent years, the usual BPHZ algorithm for renormalization in perturbative quantum field theory has been interpreted, after dimensional regularization, as a Birkhoff decomposition of characters on the Hopf algebra of Feynman graphs, with values in a Rota-Baxter algebra of amplitudes. We associate in this paper to any such algebra a universal semi-group (different in nature from the Connes-Marcolli "cosmical Galois group"). Its action on the physical amplitudes associated to Feynman graphs produces the expected operations: Bogoliubov's preparation map, extraction of divergences, renormalization. Read More

A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. The study of rainbow decompositions has a long history, going back to the work of Euler on Latin squares. In this paper we discuss three problems about decomposing complete graphs into rainbow trees: the Brualdi-Hollingsworth Conjecture, Constantine's Conjecture, and the Kaneko-Kano-Suzuki Conjecture. Read More

The "unit theorem" to which the present mini-course is devoted is a theorem from algebra that has a combinatorial flavour, and that originated in fact from algebraic combinatorics. Beyond a proof, the course also addresses applications, one of which is a proof of the normal basis theorem from Galois theory. Read More

The Motzkin numbers can be derived as coefficients of hybrid polynomials. Such an identification allows the derivation of new identities for this family of numbers and offers a tool to investigate previously unnoticed links with the theory of special functions and with the relevant treatment in terms of operational means. The use of umbral methods opens new directions for further developments and generalizations, which leads, e. Read More

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot a=\sum_{i=1}^n \varepsilon^ia_i$. In this paper we will solve for $n=1,2,\ldots,9$ an old conjecture stating that of the $2^n$ sums of the form $\sum\pm a_i$ it is impossible that there are more with $|\sum_{i=1}^n \pm a_i|>1$ than there are with $|\sum_{i=1}^n \pm a_i|\leq1$. Although the problem has been solved completely in case the $a_i$'s are equal, the more general problem with possible non-equal $a_i$'s remains open for values of $n\geq 10$. Read More

Gottschalk and Vygen proved that every solution of the well-known subtour elimination linear program for traveling salesman paths is a convex combination of a set of more and more restrictive "generalized Gao trees" of the underlying graph. In this paper we give a short proof of this, as a {\em layered} convex combination of bases of a sequence of more and more restrictive matroids. Our proof implies (via the matroid partition theorem) a strongly-polynomial combinatorial algorithm for finding this convex combination. Read More

Let $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r}$, where $r,n_1,\cdots, n_r$ are
positive integers and $p_1,p_2,\cdots,p_r$ are distinct prime numbers with
$p_1

The aim of this paper is to understand general universality principles for random network models whose component sizes in the critical regime lie in the multiplicative coalescent universality class but with heavy tails resulting in hubs. For the multiplicative coalescent in this regime, limit (random) metric spaces via appropriate tilts of inhomogeneous continuum random trees were derived by Bhamidi et al. (2015). Read More

In a graph, a Clique-Stable Set separator (CS-separator) is a family $\mathcal{C}$ of cuts (bipartitions of the vertex set) such that for every clique $K$ and every stable set $S$ with $K \cap S = \emptyset$, there exists a cut $( W,W')$ in $\mathcal{C}$ such that $K \subseteq W$ and $S \subseteq W'$. Starting from a question concerning extended formulations of the Stable Set polytope and a related complexity communication problem, Yannakakis [17] asked in 1991 the following questions: does every graph admit a polynomial-size CS-separator? If not, does every perfect graph do? Several positive and negative results related to this question were given recently. Here we show how graph decomposition can be used to prove that a class of graphs admits a polynomial CS-separator. Read More

Bulgarian solitaire is played on $n$ cards divided into several piles; a move consists of picking one card from each pile to form a new pile. In a recent generalization, $\sigma$-Bulgarian solitaire, the number of cards you pick from a pile is some function $\sigma$ of the pile size, such that you pick $\sigma(h)\le h$ cards from a pile of size $h$. Here we consider a special class of such functions. Read More

An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. Read More

We consider a family of I-graphs I(n,k,l), which is a generalization of the class of generalized Petersen graphs. In the present paper, we provide a new method for counting Jacobian group of the I-graph I(n,k,l). We show that the minimum number of generators of Jac(I(n,k,l)) is at least two and at most 2k + 2l - 1. Read More

In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a result recently obtained conditionally by Beresnevich, Haynes and Velani. The idea is to find large generalised arithmetic progressions within inhomogeneous Bohr sets, extending a construction given by Tao. Read More

For a graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$. Recently, there has been an effort to obtain bounds on the chromatic number $\chi(G^{[\natural p]})$ of exact distance-$p$ graphs for $G$ from certain classes of graphs. In particular, if a graph $G$ has tree-width $t$, it has been shown that $\chi(G^{[\natural p]}) \in \mathcal{O}(p^{t-1})$ for odd $p$, and $\chi(G^{[\natural p]}) \in \mathcal{O}(p^{t}\cdot \Delta(G))$ for even $p$. Read More

We study finite groups $G$ having a subgroup $H$ and $D \subset G \setminus H$ such that the multiset $\{ xy^{-1}:x,y \in D\}$ has every non-identity element occur the same number of times (such a $D$ is called a {\it difference set}). We show that $H$ has to be normal, that $|G|=|H|^2$, and that $|D \cap Hg|=|H|/2$ for all $g \notin H$. We show that $H$ is contained in every normal subgroup of prime index, and other properties. Read More

We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of partitions, while the set of all partitions has infinite dimension, we show that every proper downset of partitions has finite dimension. For compositions we identify four minimal downsets of infinite dimension and establish that every downset which does not contain one of these four has finite dimension. Read More

A one-to-one correspondence between the infinitesimal motions of bar-joint frameworks in $\mathbb{R}^d$ and those in $\mathbb{S}^d$ is a classical observation by Pogorelov, and further connections among different rigidity models in various different spaces have been extensively studied. In this paper, we shall extend this line of research to include the infinitesimal rigidity of frameworks consisting of points and hyperplanes. This enables us to understand correspondences between point-hyperplane rigidity, classical bar-joint rigidity, and scene analysis. Read More

Let ${\mathcal G}_k(V)$ be the $k$-Grassmannian of a vector space $V$ with $\dim V=n$. Given a hyperplane $H$ of ${\mathcal G}_k(V)$, we define in [I. Cardinali, L. Read More

We consider the modeling approach introduced by R. Thomas for the qualitative study of gene regulatory networks. Tools and results on regulatory networks are often concerned only with the Boolean case of this formalism. Read More

We perform a key step towards the proof of Zvonkine's conjectural $r$-ELSV formula that relates Hurwitz numbers with completed $(r+1)$-cycles to the geometry of the moduli spaces of the $r$-spin structures on curves: we prove the quasi-polynomiality property prescribed by Zvonkine's conjecture. Moreover, we propose an orbifold generalization of Zvonkine's conjecture and prove the quasi-polynomiality property in this case as well. In addition to that, we study the $(0,1)$- and $(0,2)$-functions in this generalized case and we show that these unstable cases are correctly reproduced by the spectral curve initial data. Read More