Related papers: Additive induced-hereditary properties and unique …
We show that hereditarily indecomposable spaces can be characterized by a special instance of the Intermediate Value Theorem in their rings of continuous functions.
Visual objects are composed of a recursive hierarchy of perceptual wholes and parts, whose properties, such as shape, reflectance, and color, constitute a hierarchy of intrinsic causal factors of object appearance. However, object…
Coloring the arcs of biregular graphs was introduced with possible applications to industrial chemistry, molecular biology, cellular neuroscience, etc. Here, we deal with arc coloring in some non-bipartite graphs. In fact, for…
We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…
Subfactors of the hyperfinite II$_1$ factor with ''exotic'' properties can be constructed from nondegenerate commuting squares of multi-matrix algebras. We show that the subfactor planar algebra of these commuting square subfactors…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
We construct exponential objects in categories of generalized uniform hypergraphs and use embeddings induced by nerve-realization adjunctions to show why conventional categories of graphs and hypergraphs do not have exponential objects.
A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each…
In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful…
Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a…
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…
In the enriched setting, the notions of injective and projective model structures on a category of enriched diagrams also make sense. In this paper, we prove the existence of these model structures on enriched diagram categories under local…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…
In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…
Recent works of Alon-Shapira and R\"odl-Schacht have demonstrated that every hereditary property of undirected graphs or hypergraphs is testable with one-sided error; informally, this means that if a graph or hypergraph satisfies that…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…