Related papers: The hereditariness problem for the \v{C}ern\'y con…
In this paper, we apply liaison theory to the Eisenbud-Green-Harris conjecture and prove that the conjecture holds for a certain subclass of homogeneous ideals in the linkage class of a complete intersection ideal. In the case of three…
For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a…
Rota's basis conjecture states that in any square array of vectors whose rows are bases of a fixed vector space the vectors can be rearranged within their rows in such a way that afterwards not only the rows are bases, but also the columns.…
In this paper we introduce a special kind of relative (co)resolutions associated to a pair of classes of objects in an abelian category $\mathcal{C}.$ We will see that, by studying these relative (co)resolutions, we get a possible…
In 1964 \v{C}ern\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in…
Consider a reflection from a finitely-complete category $\mathbb{C}$ into its full subcategory $\mathbb{M}$, with unit $\eta :1_\mathbb{C}\rightarrow HI$. Suppose there is a left-exact functor $U$ into the category of sets, such that $UH$…
The classical Melan equation modeling suspension bridges is considered. We first study the explicit expression and the uniform positivity of the analytical solution for the simplified ``less stiff'' model, based on which we develop a…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
We briefly show how classical mechanics can be rederived and better understood as a consequence of three assumptions: infinitesimal reducibility, deterministic and reversible evolution, and kinematic equivalence.
A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be…
In this note by using elementary considerations, we settle Fr\"oberg's conjecture for a large number of cases, when all generators of ideals have the same degree.
Let $X=(x_{ij})$ and $Y=(y_{ij})$ be generic $n$ by $n$ matrices and $Z=XY-YX$. Let $S=k[x_{11},...,x_{nn},y_{11},...,y_{nn}]$, where $k$ is a field, let $I$ be the ideal generated by the entries of $Z$ and let $R=S/I$. We give a conjecture…
We study the compatibility of Arthur's conjecture for $R$-groups in the restriction of discrete series representations from Levi subgroups of a $p$-adic group to those of its closed subgroup having the same derived group. The compatibility…
In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…
The notion of path-complete positivity is introduced as a way to generalize the property of positivity from one LTI system to a family of switched LTI systems whose switching rule is constrained by a finite automaton. The generalization…
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
Our understanding of the Universe breaks down for very small spacetime intervals, corresponding to an extremely high level of granularity (and energy), commonly referred to as the ``Planck scale''. At this fundamental level, there are…
We present a mechanism which lifts a multiplicative lattice to a (weak) ideal system on some monoid.
We prove a non-minimal modularity lifting theorem for ordinary Galois representations over imaginary quadratic fields, conditional on a local-global compatibility conjecture for ordinary torsion classes.