English
Related papers

Related papers: Additive reducts of real closed fields and strongl…

200 papers

In this paper we study the $L^p-L^r$ boundedness of the extension operators associated with paraboloids in vector spaces over finite fields.In higher even dimensions, we estimate the number of additive quadruples in the subset $E$ of the…

Classical Analysis and ODEs · Mathematics 2008-05-08 Alex Iosevich , Doowon Koh

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…

Information Theory · Computer Science 2009-04-30 Yanling Chen , Han Vinck

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Let $k$ be a nonperfect separably closed field. Let $G$ be a (possibly non-connected) reductive group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In our previous work, we…

Group Theory · Mathematics 2019-03-15 Tomohiro Uchiyama

In this paper we study the question of whether on smooth projective surfaces the denominators in the volumes of big line bundles are bounded. In particular we investigate how this condition is related to bounded negativity (i.e., the…

Algebraic Geometry · Mathematics 2019-04-17 Thomas Bauer , Brian Harbourne , Alex Küronya , Matthias Nickel

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Representation Theory · Mathematics 2026-04-21 Shahar Dagan

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

Rings and Algebras · Mathematics 2026-05-14 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

New splitting theorems in a semi-Riemannian manifold which admits an irrotational vector field (not necessarily a gradient) with some suitable properties are obtained. According to the extras hypothesis assumed on the vector field, we can…

Differential Geometry · Mathematics 2007-05-23 Manuel Gutierrez , Benjamin Olea

We construct a fractured structure, in the sense of Lurie, on the $\infty$-topos of condensed anima. This fractured structure allows us to better comprehend various properties of condensed anima - we use it to exhibit an explicit collection…

Algebraic Topology · Mathematics 2026-03-11 Nima Rasekh , Qi Zhu

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Rings and Algebras · Mathematics 2025-06-17 Hiroki Aoki , Hiraku Kawanoue

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

Artificial Intelligence · Computer Science 2012-09-26 Jingqian Wang , William Zhu

Let $\mathcal{O}_n$ be the set of ordered labeled trees on ${0,...,n}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study…

Combinatorics · Mathematics 2022-03-22 Seunghyun Seo , Heesung Shin

We introduce the family of trimmed serendipity finite element differential form spaces, defined on cubical meshes in any number of dimensions, for any polynomial degree, and for any form order. The relation between the trimmed serendipity…

Numerical Analysis · Mathematics 2018-01-08 Andrew Gillette , Tyler Kloefkorn

Given a weakly o-minimal structure $\mathcal M$ and its o-minimal completion $\bar {\mathcal M}$, we first associate to $\bar {\mathcal M}$ a canonical language and then prove that $Th(\mathcal M)$ determines $Th(\bar {\mathcal M})$. We…

Logic · Mathematics 2019-06-12 Elitzur Bar-Yehuda , Assaf Hasson , Ya'acov Peterzil

We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…

Representation Theory · Mathematics 2019-03-26 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…

Logic · Mathematics 2026-03-06 Pietro Freni

In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…

Algebraic Geometry · Mathematics 2022-10-25 Askold Khovanskii

Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…

Artificial Intelligence · Computer Science 2015-03-06 Aiping Huang , William Zhu
‹ Prev 1 8 9 10 Next ›