相关论文: On a variant of Flory model

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

This paper addresses the challenge of object-centric layout generation under spatial constraints, seen in multiple domains including floorplan design process. The design process typically involves specifying a set of spatial constraints…

We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic…

We study fermions on a finite chain, interacting repulsively when residing on the same and on nearest-neighbor sites, and subjected to a Wannier-Stark linearly-varying potential. Using the density matrix renormalization-group numerical…

Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 year. In this paper, we study the following Ramsey version of these problems. Given a set $L\subseteq…

In water-limited regions, competition for water resources results in the formation of vegetation patterns; on sloped terrain, one finds that the vegetation typically aligns in stripes or arcs. We consider a two-component…

Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…

Our goal is to visualize an additional data dimension of a tree with multifaceted data through superimposition on vertical strips, which we call columns. Specifically, we extend upward drawings of unordered rooted trees where vertices have…

The state-of-the-art solvers for the graph isomorphism problem can readily solve generic instances with tens of thousands of vertices. Indeed, experiments show that on inputs without particular combinatorial structure the algorithms scale…

We create 4200 synthetic cities which vary in percent minority population and their residential segregation patterns. Of these, 1200 are modeled on existing cities, and 3000 are rectangular grid cities. In each city, we consider…

We prove that, for any finite set of minimal $r$-graph patterns, there is a finite family $\mathcal F$ of forbidden $r$-graphs such that the extremal Tur\'an constructions for $\mathcal F$ are precisely the maximum $r$-graphs obtainable…

The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…

We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…

In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence…

In this paper, we introduce the Fixed Topology Minimum-Length Tree with Neighborhood Problem, which aims to embed a rooted tree-shaped graph into a $d$-dimensional metric space while minimizing its total length provided that the nodes must…

Many disciplines of science and engineering deal with problems related to compositions, ranging from chemical compositions in materials science to portfolio compositions in economics. They exist in non-Euclidean simplex spaces, causing many…

Two line arrangements in $\mathbb{CP}^2$ can have different topological properties even if they are combinatorially isomorphic. Results by Dan Cohen and Suciu and by Randell show that a reducible moduli space under complex conjugation is a…

In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned…

We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space…

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…