Related papers: Normal Order: Combinatorial Graphs
Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…
In this paper, we consider the problem of order preservation under addition and multiplication operators over the vector space of univariate real-valued random variables. Consistent with the case of usual order over the real numbers-as…
We demonstrate that a single training trajectory can transform a graph neural network into an unsupervised heuristic for combinatorial optimization. Focusing on the Travelling Salesman Problem, we show that encoding global structural…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
The generalized massive Thirring model (GMT) with three fermion species is bosonized in the context of the functional integral and operator formulations and shown to be equivalent to a generalized sine-Gordon model (GSG) with three…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
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 show that a dynamical supersymmetry can appear in a purely fermionic system. This ``supersymmetry without bosons" is constructed by application of a recently introduced boson-fermion Dyson mapping from a fermion space to a space…
Much of dynamical algebraic combinatorics focuses on global dynamical systems defined via maps that are compositions of local toggle operators. The second author and Roby studied such maps that result from toggling independent sets of a…
Seriation methods order a set of descriptions given some criterion (e.g., unimodality or minimum distance between similarity scores). Seriation is thus inherently a problem of finding the optimal solution among a set of permutations of…
In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…
The Int_reg-problem of a combinatorial problem P asks, given a nondeterministic automaton M as input, whether the language L(M) accepted by M contains any positive instance of the problem P. We consider the Int_reg-problem for a number of…
The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in…
Wick's theorem provides a connection between time ordered products of bosonic or fermionic fields, and their normal ordered counterparts. We consider a generic pair of operator orderings and we prove, by induction, the theorem that relates…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
We consider simple CFT models which contain massless bosons, or massless fermions or a supersymmetric combination of the two, on the strip. We study the deformations of these models by relevant boundary operators. In particular, we work out…
Determining whether an arbitrary subring $R$ of $k[x_1^{\pm 1},\dots, x_n^{\pm 1}]$ is a normal domain is, in general, a nontrivial problem, even in the special case of a monomial generated domain. In this paper, we provide a complete…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…