Related papers: Ice-Flower Systems And Star-graphic Lattices
A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…
For a finite index sublattice $L$ of the root lattice $A_{n}$, we construct a deterministic algorithm to deform the lattice ideal $I_L$ to a nearby generic lattice ideal, answering a question posed by Miller and Sturmfels. Our algorithm is…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
Sunflowers, or $\Delta$-systems, are a fundamental concept in combinatorics introduced by Erd\H{o}s and Rado in their paper: {\em Intersection theorems for systems of sets}, J. Lond. Math. Soc. (1) {\bf 35} (1960), 85--90. A sunflower is a…
Technicolor theories provide an elegant mechanism for dynamical electroweak symmetry breaking. We will discuss the use of lattice simulations to study the strongly-interacting dynamics of some of the candidate theories, with matter fields…
The problem of automated separation of stars and galaxies on photographic plates is revisited with two goals in mind : First, to separate galaxies from everything else (as opposed to most previous work, in which galaxies were lumped…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact one-to-one correspondence between the closed graphs on SC…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…
Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory.…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions.…
We investigate in some detail consequences of the effective colour-dielectric formulation of lattice gauge theory using the light-cone Hamiltonian formalism with a transverse lattice. As a quantitative test of this approach, we have…
Galactic nuclei and globular clusters act as laboratories in which nature experiments with normal stars, neutron stars and black holes, through collisions and through the formation of bound states, in the form of binaries. The main…