Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finit...
About twenty years ago, Green wrote a survey article on the utility of looking at toy versions over finite fields of problems in additive combinatorics. This article was extremely influential, and the rapid development of additive combinatorics neces...
The study of many problems in additive combinatorics, such as Szemerédi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of finite fie...
We study the notion of formal self duality in finite abelian groups. Formal duality in finite abelian groups has been proposed by Cohn, Kumar, Reiher and Schürmann. In this paper we give a precise definition of formally self dual sets and discuss re...
A new notion of dual fusion frame has been recently introduced by the authors. In this article that notion is further motivated and it is shown that it is suitable to deal with questions posed in a finite-dimensional real or complex Hilbert space, re...
The classical frame potential in a finite dimensional Hilbert space has been introduced by Benedetto and Fickus, who showed that all finite unit-norm tight frames can be characterized as the minimizers of this energy functional. This was the start po...
A real Liouville domain is a Liouville domain together with an exact anti-symplectic involution. We call a real Liouville domain uniruled if there exists an invariant finite energy plane through every real point. Asymptotically an invariant finite en...
The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether the word...
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal wor...
A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof based on a k...
N = 1, all-loop Finite Unified Theories (FUTs) are very interesting not only since they realize an old theoretical dream, but also due the remarkable predictive power of particular models as well as for providing candidates that might shed light in...
All-loop Finite Unified Theories (FUTs) are very interesting N=1 supersymmetric Grand Unified Theories (GUTs) realising an old field theory dream, and moreover have a remarkable predictive power due to the required reduction of couplings. The reducti...
All-loop Finite Unified Theories (FUTs) are very interesting N=1 supersymmetric Grand Unified Theories (GUTs) which not only realise an old field theoretic dream but also have a remarkable predictive power due to the required reduction of couplings....
A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices....
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of generators and r...
We introduce a novel embedding method diverging from conventional approaches by operating within function spaces of finite dimension rather than finite vector space, thus departing significantly from standard knowledge graph embedding techniques. Ini...
For a finite quiver $Q$ without sinks, we consider the corresponding finite dimensional algebra $A$ with radical square zero. We construct an explicit compact generator for the homotopy category of acyclic complexes of injective $A$-modules. We call...
We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt path algebra...
We construct conforming finite elements for the spaces $H(\text{sym}\,\text{Curl})$ and $H(\text{dev}\,\text{sym}\,\text{Curl})$. Those are spaces of matrix-valued functions with symmetric or deviatoric-symmetric $\text{Curl}$ in a Lebesgue space, an...
In this paper, for a new Stekloff eigenvalue problem which is non-selfadjoint and not $H^1$-elliptic, we establish and analyze two kinds of two-grid discretization scheme and a local finite element scheme. We present the error estimates of approximat...