Related papers: Towards a characterization of the star-free sets o…
In this paper, we study representations of real numbers in the positional numeration system with negative basis, as introduced by Ito and Sadahiro. We focus on the set $\Z_{-\beta}$ of numbers whose representation uses only non-negative…
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…
A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs.
Given a finite poset P, we consider the largest size La(n,P) of a family of subsets of $[n]:=\{1,...,n\}$ that contains no subposet P. This problem has been studied intensively in recent years, and it is conjectured that $\pi(P):=…
We introduce \emph{patterned numbers}, a digit--divisor-based classification of integers motivated by recreational mathematics. A number is defined to be patterned if at least one of its positive divisors appears as a digit in its base-10…
A class of general relativistic solutions in isotropic spherical polar coordinates are discussed which describe compact stars in hydrostatic equilibrium. The stellar models obtained here are characterized by four parameters, namely,…
Astronomers generally assume planet-forming disks are aligned with the rotation of their host star. However, recent observations have shown evidence of warping in protoplanetary disks. One can measure the statistical alignment between the…
In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…
This paper studies the notions of star and semistar operations over a polynomial ring. It aims at characterizing when every upper to zero in $R[X]$ is a $*$-maximal ideal and when a $*$-maximal ideal $Q$ of $R[X]$ is extended from $R$, that…
A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…
In this article we present a refinement of the base point free theorem for threefolds in positive characteristic. If $L$ is a nef Cartier divisor of numerical dimension at least one on a projective Kawamata log terminal threefold…
Let $K$ be a finite extension of $\mathbb{Q}$ and $\mathcal{O}_K$ be its ring of integers. Let $\mathfrak{B}$ be a primitive collection of ideals in $\mathcal{O}_K$. We show that any $\mathfrak{B}$-free system is essentially minimal.…
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: for what values of $k>d/2$ does the random $d$-regular graph have a $k$-star…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
We progress with the investigation started in article \cite{Roman2022}, namely the analysis of the asymptotic behaviour of $Q_{\mathcal{P}}(x)$ for different sets $\mathcal{P}$, where $Q_{\mathcal{P}}(x)$ is the element count of the set…
Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…