Related papers: The weight distribution of irreducible cyclic code…

Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…

We present an approach to reduced-order modelling that builds off recent graph-theoretic work for representation, exploration, and analysis of computed states of physical systems (Banerjee et al., Comp. Meth. App. Mech. Eng., 351, 501-530,…

In the first part of this paper, we discuss the notion of irreducibility of cycles in the moduli spaces of n-marked rational tropical curves. We prove that Psi-classes and vital divisors are irreducible, and that locally irreducible…

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…

In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…

A visibility algorithm maps time series into complex networks following a simple criterion. The resulting visibility graph has recently proven to be a powerful tool for time series analysis. However its straightforward computation is…

We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…

The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…

Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…

Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions…

We establish the coarse relative trace formulae of Jacquet-Rallis for linear and unitary groups. Both formulae are of the form: a sum of spectral distributions equals a sum of geometric distributions. In order to obtain the spectral…

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that…

Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their…

We make progress on three long standing conjectures from the 1960s about path and cycle decompositions of graphs. Gallai conjectured that any connected graph on $n$ vertices can be decomposed into at most $\left\lceil…