English
Related papers

Related papers: Existence and explicit formula for a semigroup rel…

200 papers

The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…

Group Theory · Mathematics 2008-12-19 Karsten Henckell , John Rhodes , Benjamin Steinberg

This paper provides necessary and sufficient conditions for the existence of free boundaries in overdetermined value-problems (ODVP) for the Laplacian, and sufficient conditions for the bi-Laplacian, when the overdetermined boundary…

Analysis of PDEs · Mathematics 2026-04-02 Mohammed Barkatou , Samira Khatmi

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

Group Theory · Mathematics 2026-01-22 James East , Attila Egri-Nagy , Andrew R. Francis , James D. Mitchell

We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…

Combinatorics · Mathematics 2013-09-13 Ellen Veomett

Based on the Chernoff approximation, we provide a general approximation result for convex monotone semigroups which are continuous w.r.t. the mixed topology on suitable spaces of continuous functions. Starting with a family $(I(t))_{t\geq…

Probability · Mathematics 2024-10-29 Jonas Blessing , Michael Kupper

Ranges of the real-valued parameters $\alpha$, $a$, $b$, and $m$ are identified for which the operator $$\mathcal{A}_{\alpha}(a,b)f(x):=x^\alpha\left(f''(x)+\frac{a}{x}f'(x)+\frac{b}{x^2}f(x)\right), \quad x>0,$$ generates an analytic…

Analysis of PDEs · Mathematics 2024-06-25 Patrick Guidotti , Philippe Laurençot , Christoph Walker

The aim of this paper is first to give necessary and sufficient condition of existence (of free boundaries) for both Laplacian and bi-Laplacian operators in the case where the overdetermined condition is not constant. second, by using some…

Analysis of PDEs · Mathematics 2023-04-11 Mohammed Barkatou

In this work we derive an interval turnpike result for adjoints of finite- and infinite-dimensional nonlinear optimal control problems under the assumption of an interval turnpike on states and controls. We consider stabilizable dynamics…

Optimization and Control · Mathematics 2020-05-26 Timm Faulwasser , Lars Grüne , Jukka-Pekka Humaloja , Manuel Schaller

In this paper, we consider the Laplace equation with a class of indefinite superlinear boundary conditions and study the uniqueness of positive solutions that this problem possesses. Superlinear elliptic problems can be expected to have…

Analysis of PDEs · Mathematics 2024-01-22 Kenichiro Umezu

Let a finitely generated group $G$ split as a graph of groups. If edge groups are undistorted and do not contribute to the Morse boundary $\partial_MG$, we show that every connected component of $\partial_MG$ with at least two points…

Group Theory · Mathematics 2022-07-20 Elia Fioravanti , Annette Karrer

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…

Statistics Theory · Mathematics 2008-04-14 Akimichi Takemura , Ruriko Yoshida

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…

Combinatorics · Mathematics 2024-10-10 T. Gomyou , S. Nayatani

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

Combinatorics · Mathematics 2023-07-10 Pralhad M. Shinde

Based on a notion by Gray and Kambites of hyperbolicity in the setting of semimetric spaces like digraphs or semigroups, we will construct (under a small additional geometric assumption) a boundary based on quasi-geodesic rays and anti-rays…

Metric Geometry · Mathematics 2024-03-12 Matthias Hamann

Given a graph with a designated set of boundary vertices, we define a new notion of a Neumann Laplace operator on a graph using a reflection principle. We show that the first eigenvalue of this Neumann graph Laplacian satisfies a Cheeger…

Spectral Theory · Mathematics 2020-07-15 Edward Gelernt , Diana Halikias , Charles Kenney , Nicholas F. Marshall

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

Combinatorics · Mathematics 2009-05-06 Sergi Elizalde

In this paper, we are concerned with the first initial boundary value problem for a class of fully nonlinear parabolic equations on Riemannian manifolds. As usual, the establishment of the a priori C^2 estimates is our main part. Based on…

Analysis of PDEs · Mathematics 2015-02-17 Weisong Dong , Heming Jiao

Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary…

Data Structures and Algorithms · Computer Science 2007-05-23 David Steurer

We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…

Logic in Computer Science · Computer Science 2010-07-23 Lucas Dixon , Ross Duncan , Aleks Kissinger