Related papers: A non-flag arithmetic regularity lemma and countin…
In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…
A matrix \( A \) is called \emph{kernel partition regular} if, for every finite coloring of the natural numbers \( \mathbb{N} \), there exists a monochromatic solution to the equation \( A\vec{X} = 0 \). In 1933, Rado characterized such…
We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system which is not controllable by real static…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…
Over a field of characteristic zero we prove two formality conditions. We prove that a dg Lie algebra is formal if and only if its universal enveloping algebra is formal. We also prove that a commutative dg algebra is formal as a dg…
Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free…
We show that for every positive integer R there exist monomial ideals generated in degree two, with linear syzygies, and regularity of the quotient equal to R. Such examples can not be found among Gorenstein ideals since the regularity of…
Green developed an arithmetic regularity lemma to prove a strengthening of Roth's theorem on arithmetic progressions in dense sets. It states that for every $\epsilon > 0$ there is some $N_0(\epsilon)$ such that for every $N \ge…
Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…
We show that the linearity of an evolution of Quantum Mechanics follows from the definition of kinematics. The same result is obtained for an arbitrary theory with the state space that includes mixtures of different preparations. Next, we…
A general form of the Lions-Magenes theorems on solvability of an elliptic boundary-value problem in the spaces of nonregular distributions is proved. We find a general condition on the space of right-hand sides of the elliptic equation…
The controllability condition for finite dimensional quantum systems, the Lie Algebra Rank Condition, has been stated assuming that the right invariant differential system under consideration is bilinear. We remark that this assumption is…
For thermal equilibrium systems it is shown, how the Kubo-Martin-Schwinger boundary condition may be used to factorize the generating functional of Green functions at least on the level of the full two-point function. Genuine…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
We prove a Green--Tao theorem for multiplicative functions.
In the past years, analyzers have been introduced to detect classes of non-terminating queries for definite logic programs. Although these non-termination analyzers have shown to be rather precise, their applicability on real-life Prolog…
This paper establishes lower bounds for two kinds of arithmetic regularity partitions, building on constructions of Green [arXiv:math/0310476v2] and Hosseini, Lovett, Moshkovitz, and Shapira [arXiv:1405.4409]. The first kind occurs in the…
The regularity lemma is a stringent condition of the possible ranks of tensor blow-ups of linear subspaces of matrices. It was proved by Ivanyos, Qiao and Subrahmanyam when the underlying field is sufficiently large. We show that if the…
In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.