Related papers: On the Existence of Semi-Regular Sequences

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

In this article, we discuss the semicontinuity problem of certain properties on fibers for a morphism of schemes. One aspect of this problem is local. Namely, we consider properties of schemes at the level of local rings, in which the main…

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…

We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

We prove that an hypersemigroup $H$ is regular if and only, for any fuzzy subset $f$ of $H$, we have $f\preceq f\circ 1\circ f$ and it is intra-regular if and only if, for any fuzzy subset $f$ of $H$, we have $f\preceq 1\circ f\circ f\circ…

This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…

We prove a nearly optimal bound on the number of stable homotopy types occurring in a k-parameter semi-algebraic family of sets in $\R^\ell$, each defined in terms of m quadratic inequalities. Our bound is exponential in k and m, but…

A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…

In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…

We study the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$, which is introduced in the paper [O. Gutik and M. Mykhalenych, \emph{On some generalization of the bicyclic monoid}, Visnyk Lviv. Univ. Ser. Mech.-Mat. \textbf{90} (2020),…

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…

We study the convergence rates of the semi-discrete (SD) method originally proposed in Halidias (2012), Semi-discrete approximations for stochastic differential equations and applications, International Journal of Computer Mathematics,…

We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…

We determine the distributions of lengths of runs in random sequences of elements from a totally ordered set (total order) or partially ordered set (partial order). In particular, we produce novel formulae for the expected value, variance,…

The steepness property is a local geometric transversality condition on the gradient of a $C^2$-function which is fundamental in order to ensure the stability of sufficiently-regular nearly-integrable Hamiltonian systems over long…