751 research outputs found

    H_2-Optimal Decentralized Control over Posets: A State-Space Solution for State-Feedback

    Full text link
    We develop a complete state-space solution to H_2-optimal decentralized control of poset-causal systems with state-feedback. Our solution is based on the exploitation of a key separability property of the problem, that enables an efficient computation of the optimal controller by solving a small number of uncoupled standard Riccati equations. Our approach gives important insight into the structure of optimal controllers, such as controller degree bounds that depend on the structure of the poset. A novel element in our state-space characterization of the controller is a remarkable pair of transfer functions, that belong to the incidence algebra of the poset, are inverses of each other, and are intimately related to prediction of the state along the different paths on the poset. The results are illustrated by a numerical example.Comment: 39 pages, 2 figures, submitted to IEEE Transactions on Automatic Contro

    Gr\"obner methods for representations of combinatorial categories

    Full text link
    Given a category C of a combinatorial nature, we study the following fundamental question: how does the combinatorial behavior of C affect the algebraic behavior of representations of C? We prove two general results. The first gives a combinatorial criterion for representations of C to admit a theory of Gr\"obner bases. From this, we obtain a criterion for noetherianity of representations. The second gives a combinatorial criterion for a general "rationality" result for Hilbert series of representations of C. This criterion connects to the theory of formal languages, and makes essential use of results on the generating functions of languages, such as the transfer-matrix method and the Chomsky-Sch\"utzenberger theorem. Our work is motivated by recent work in the literature on representations of various specific categories. Our general criteria recover many of the results on these categories that had been proved by ad hoc means, and often yield cleaner proofs and stronger statements. For example: we give a new, more robust, proof that FI-modules (originally introduced by Church-Ellenberg-Farb), and a family of natural generalizations, are noetherian; we give an easy proof of a generalization of the Lannes-Schwartz artinian conjecture from the study of generic representation theory of finite fields; we significantly improve the theory of Δ\Delta-modules, introduced by Snowden in connection to syzygies of Segre embeddings; and we establish fundamental properties of twisted commutative algebras in positive characteristic.Comment: 41 pages; v2: Moved old Sections 3.4, 10, 11, 13.2 and connected text to arxiv:1410.6054v1, Section 13.1 removed and will appear elsewhere; v3: substantial revision and reorganization of section

    Diszkrét matematika = Discrete mathematics

    Get PDF
    A pályázat résztvevői igen aktívak voltak a 2006-2008 években. Nemcsak sok eredményt értek el, miket több mint 150 cikkben publikáltak, eredményesen népszerűsítették azokat. Több mint 100 konferencián vettek részt és adtak elő, felerészben meghívott, vagy plenáris előadóként. Hagyományos gráfelmélet Több extremális gráfproblémát oldottunk meg. Új eredményeket kaptunk Ramsey számokról, globális és lokális kromatikus számokról, Hamiltonkörök létezéséséről. a crossig numberről, gráf kapacitásokról és kizárt részgráfokról. Véletlen gráfok, nagy gráfok, regularitási lemma Nagy gráfok "hasonlóságait" vizsgáltuk. Különféle metrikák ekvivalensek. Űj eredeményeink: Hereditary Property Testing, Inverse Counting Lemma and the Uniqueness of Hypergraph Limit. Hipergráfok, egyéb kombinatorika Új Sperner tipusú tételekte kaptunk, aszimptotikusan meghatározva a halmazok max számát bizonyos kizárt struktőrák esetén. Több esetre megoldottuk a kizárt hipergráf problémát is. Elméleti számítástudomány Új ujjlenyomat kódokat és bioinformatikai eredményeket kaptunk. | The participants of the project were scientifically very active during the years 2006-2008. They did not only obtain many results, which are contained in their more than 150 papers appeared in strong journals, but effectively disseminated them in the scientific community. They participated and gave lectures in more than 100 conferences (with multiplicity), half of them were plenary or invited talks. Traditional graph theory Several extremal problems for graphs were solved. We obtained new results for certain Ramsey numbers, (local and global) chromatic numbers, existence of Hamiltonian cycles crossing numbers, graph capacities, and excluded subgraphs. Random graphs, large graphs, regularity lemma The "similarities" of large graphs were studied. We show that several different definitions of the metrics (and convergence) are equivalent. Several new results like the Hereditary Property Testing, Inverse Counting Lemma and the Uniqueness of Hypergraph Limit were proved Hypergraphs, other combinatorics New Sperner type theorems were obtained, asymptotically determining the maximum number of sets in a family of subsets with certain excluded configurations. Several cases of the excluded hypergraph problem were solved. Theoretical computer science New fingerprint codes and results in bioinformatics were found

    Resolutions and Cohomologies of Toric Sheaves. The affine case

    Full text link
    We study equivariant resolutions and local cohomologies of toric sheaves for affine toric varieties, where our focus is on the construction of new examples of decomposable maximal Cohen-Macaulay modules of higher rank. A result of Klyachko states that the category of reflexive toric sheaves is equivalent to the category of vector spaces together with a certain family of filtrations. Within this setting, we develop machinery which facilitates the construction of minimal free resolutions for the smooth case as well as resolutions which are acyclic with respect to local cohomology functors for the general case. We give two main applications. First, over the polynomial ring, we determine in explicit combinatorial terms the Z^n-graded Betti numbers and local cohomology of reflexive modules whose associated filtrations form a hyperplane arrangement. Second, for the non-smooth, simplicial case in dimension d >= 3, we construct new examples of indecomposable maximal Cohen-Macaulay modules of rank d - 1.Comment: 39 pages, requires packages ams*, enumerat

    The interval inclusion number of a partially ordered set

    Get PDF
    AbstractA containment representation for a poset P is a map ƒ such that x<y in P if and only if ƒ(x) ⊂ ƒ(y). We introduce the interval inclusion number (or interval number) i(P) as the smallest t such that P has a containment representation f in which each f(x) is the union of at most t intervals. Trivially, i(P)=1 if and only if dim(P)⩽2. Posets with i(P)=2 include the standard n-dimensional poset and all interval orders; i.e. posets of arbitrarily high dimension. In general we have the upper bound i(P) ⩽ ⌈;dim(P)2⌉, with equality holding for the Boolean algebras. For lexicographic composition, i(P) = k and dim(Q) = 2k + 1 imply i(P[Q]) = k + 1. This result and i(B2k) = k imply that testing i(P) ⩽ k for any fixed k ⩾ 2 is NP-complete. Concerning removal theorems, we prove that i(P − x) ⩾ i(P) − 1 when x is a maximal or minimal element of P, and in general i(P − x) ⩾ i(P)2

    Infinite combinatorial issues raised by lifting problems in universal algebra

    Full text link
    The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole array of problems, often involving lifting problems of either diagrams or objects, with respect to functors. These, in turn, involve problems that belong to infinite combinatorics. We survey some of the combinatorial problems and results thus encountered. The corresponding problematic is articulated around the notion of a k-ladder (for proving that a critical point is large), large free set theorems and the classical notation (k,r,l){\to}m (for proving that a critical point is small). In the middle, we find l-lifters of posets and the relation (k, < l){\to}P, for infinite cardinals k and l and a poset P.Comment: 22 pages. Order, to appea
    corecore